Information Technology Reference
In-Depth Information
8. L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro, Rendezvous and Election of Mobile
Agents: Impact of Sense of Direction, Theory Computer Systems 40(2), 143-162 (2007).
9. V.J. Baston, Two rendezvous search problems on the line, Naval Research Logistics 46,
335-340, 1999.
10. A. Beveridge, D. Ozsoyeller, and V. Isler, Symmetric Linear Rendezvous with an Unknown
Initial Distance, Technical Report, University of Minnesota - Computer Science and Engineer-
ing, March 2011.
11. A. Collins, J. Czyzowicz, and L. Gasieniec, A. Kosowski, and R. Martin, Synchronous
rendezvous for location-aware agents DISC 2011, 447-459.
12. C. Cooper, A.M. Frieze, and T. Radzik, Multiple Random Walks and Interacting Particle
Systems, ICALP 2009, 399-410.
13. J. Czyzowicz, L. G asieniec, A. Kosowski, and E. Kranakis, Boundary Patrolling by Mobile
Agents with Distinct Maximal Speeds, ESA 2011, 701-712.
14. J. Czyzowicz, A. Pelc, and A. Labourel, How to meet asynchronously (almost) everywhere,
ACM Transactions on Algorithms 8(4), paper 37, 2012.
15. S. Das, Distributed computing with mobile agents: solving rendezvous and related problems,
PhD Dissertation, University of Ottawa, 2007.
16. G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, and U. Vaccaro, Asynchronous
deterministic rendezvous in graphs, Theoretical Computer Science 355, 315-326, 2006.
17. A. Dessmark, P. Fraigniaud, and A. Pelc, Deterministic rendezvous in graphs, ESA 2003,
184-195.
18.
Y. Dieudonné, A. Pelc, and D. Peleg, Gathering despite mischief, SODA 2012, 527-540.
19.
P. Flocchini, B. Mans, and N. Santoro, Sense of direction in distributed computing, Theoretical
Computer Science 291(1), 29-53, 2003.
20.
Q. Han, D. Du, J. Vera, and L.F. Zuluaga, Improved Bounds for the Symmetric Rendezvous
Value on the Line Operations Research 56(3), 772-782, 2008.
21.
E. Kranakis, D. Krizanc and E. Markou, The Mobile Agent Rendezvous Problem in the Ring,
Synthesis Lectures on Distributed Computing Theory, 2010.
22.
D.B. Lange and M. Oshima, Seven Good Reasons for Mobile Agents, Communications of the
ACM 42(3), 88-89, 1999.
23.
R. Olfati-Saber, J.A. Fax, and R.M. Murray, Consensus and Cooperation in Networked Multi-
Agent Systems, Proc. IEEE 95(1), 215-233, 2007.
24.
A. Pelc, Deterministic rendezvous in networks: A comprehensive survey, Networks 59(3),
PP. 331-347, 2012.
25.
G. Prencipe, Impossibility of gathering by a set of autonomous mobile robots, Theoretical
Computer Science 384, 222-231, 2007.
26.
T. Schelling, The strategy of conflict, Oxford University Press, Oxford, 1960.
27.
R. Siegwart, I.R. Nourbakhsh, and D. Scaramuzza, Introduction to Autonomous Mobile
Robots (2nd Ed.), Intelligent Robotics & Autonomous Agents Series, MIT Press, 2011.
28.
G. Stachowiak, Asynchronous Deterministic Rendezvous on the Line. SOFSEM 2009,
497-508.
29.
A. Ta-Shma and U. Zwick, Deterministic rendezvous, treasure hunts and strongly universal
exploration sequences, SODA 2007, 599-608.
30.
P. Uthaisombut, Symmetric rendezvous search on the line using moving patterns with different
lengths, Working paper, Department of Computer Science, University of Pittsburgh, 2006.
Search WWH ::




Custom Search