165 search results - page 28 / 33 » Melding Abstractions with Mobile Agents |
ISAAC
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
TASE
2009
IEEE
14 years 2 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
ISRR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present an interpolation-based planning and replanning algorithm for generating smooth paths through non-uniform cost grids. Most grid-based path planners use discrete...
ECOOP
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. We are interested in the class of systems for which the satisfaction of code dependencies is a dynamic process rather than one which is determined purely at load-time. Ex...
SEC
2001
13 years 9 months ago
2001
Abstract When people want to schedule a meeting, their agendas must be compared to find a time suitable for all participants. At the same time, people want to keep their agendas pr...