Decidability classes for mobile agents computing
نویسندگان
چکیده
منابع مشابه
Decidability Classes for Mobile Agents Computing
We establish a classification of decision problems that are to be solved by mobile agents operating in unlabeled graphs, using a deterministic protocol. The classification is with respect to the ability of a team of agents to solve the problem, possibly with the aid of additional information. In particular, our focus is on studying differences between the decidability of a decision problem by a...
متن کاملMobile agents for mobile computing
Mobile agents are programs that can move through a network under their own control mi grating from host to host and interacting with other agents and resources on each We argue that these mobile autonomous agents have the potential to provide a convenient e cient and robust programming paradigm for distributed applications particularly when partially connected com puters are involved Partially ...
متن کاملReusable Mobile Agents for Cluster Computing
Adopting mobile agent technology can eliminate the need for the administrator to manage clusters, e.g., installation and upgrading of software, and auditing of clusters and networks. However, creating mobile agent-based network management systems is still in an ad-hoc manner but not on methodologies for building mobile agents for cluster and Grid computing. This paper presents a framework for r...
متن کاملMobile-Agents for Distributed Market Computing
This paper discusses the implementation using mobile agent and the performance of the market computing to allocate network quality of service most efficiently, based on users’ preference. Though the protection of users’ private preference and the efficient calculation are both important, these two requirements often contradict each other. By implementing QoS Market, a market-based network resou...
متن کاملCOMPUTING THE PRODUCTS OF CONJUGACY CLASSES FOR SPECIFIC FINITE GROUPS
Suppose $G$ is a finite group, $A$ and $B$ are conjugacy classes of $G$ and $eta(AB)$ denotes the number of conjugacy classes contained in $AB$. The set of all $eta(AB)$ such that $A, B$ run over conjugacy classes of $G$ is denoted by $eta(G)$.The aim of this paper is to compute $eta(G)$, $G in { D_{2n}, T_{4n}, U_{6n}, V_{8n}, SD_{8n}}$ or $G$ is a decomposable group of order $2pq$, a group of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2017
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2017.04.003