23 search results - page 2 / 5 » Cleaning an Arbitrary Regular Network with Mobile Agents |
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
ISW
2004
Springer
13 years 11 months ago
2004
Springer
We study the security challenges faced by the mobile agent paradigm, where code travels and performs computations on remote hosts in an autonomous manner. We define universally co...
IJWMC
2010
13 years 2 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
AGENTS
1997
Springer
13 years 9 months ago
1997
Springer
This paper describes a novel method of achieving load balancing in telecommunications networks. A simulated network models a typical distribution of calls between arbitrary nodes;...
OPODIS
2008
13 years 7 months ago
2008
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...