6 search results - page 1 / 2 » Asynchronous Deterministic Rendezvous on the Line |
SOFSEM
2009
Springer
13 years 11 months ago
2009
Springer
SIROCCO
2010
13 years 6 months ago
2010
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
The advent of multicore processors requires mainstream concurrent programming languages with high level concurrency constructs and effective debugging techniques. Unfortunately, m...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
MST
2007
13 years 4 months ago
2007
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node ...