1  2
 Kranakis, Evangelos.
 Cham, Switzerland : Springer, ©2010.
 Description
 Book — 1 online resource (xvi, 106 pages) : illustrations (some color)
 Summary

 1. Models for mobile agent computing
 Introduction
 What is a mobile agent
 Why mobile agents
 An algorithmic model for mobile agents
 Mobile agents
 Distributed networks
 Resource measures
 Mobile agent rendezvous
 Outline of the book
 Comments and bibliographic remarks.
 2. Deterministic rendezvous in a ring
 Introduction
 A single stationary token
 The feasibility of rendezvous
 The time complexity of rendezvous
 Memory tradeoff for rendezvous with detection
 Limits to the memory tradeoff
 Movable tokens
 Comments and bibliographic remarks.
 3. Multiple agent rendezvous in a ring
 Introduction
 Impossibility of rendezvous
 Rendezvous with detection
 Conditional solutions
 Comments and bibliographic remarks.
 4. Randomized rendezvous in a ring
 Introduction
 Random walk algorithm
 Randomization and tokens
 Time/memory tradeoffs
 Coin half tour algorithm
 Approximate counting algorithm
 Comments and bibliographic remarks.
 5. Other models
 Introduction
 Leader election and rendezvous
 Rendezvous with failing tokens
 Rendezvous when tokens fail upon release
 Rendezvous when tokens can fail at any time
 The cost of token failure
 Flickering tokens
 Asynchronous rendezvous
 Lookcomputemove
 Model and terminology
 Impossibility results
 Gathering configurations with a single multiplicity
 Gathering rigid configurations
 Gathering an odd number of robots
 Dangerous networks
 Blackhole search in an asynchronous ring
 Rendezvous in asynchronous rings in spite of a blackhole
 Comments and bibliographic remarks.
 6. Other topologies
 Introduction
 Synchronous torus
 Memory lower bounds for rendezvous
 Rendezvous algorithms
 Trees
 Arbitrary graphs
 Comments and bibliographic remarks.
 Bibliography
 Glossary
 Authors' biographies
 Index.
 Kranakis, Evangelos.
 San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, c2010.
 Description
 Book — 1 electronic text (xvi, 106 p.) : ill.
 Summary

 1. Models for mobile agent computing
 Introduction
 What is a mobile agent
 Why mobile agents
 An algorithmic model for mobile agents
 Mobile agents
 Distributed networks
 Resource measures
 Mobile agent rendezvous
 Outline of the book
 Comments and bibliographic remarks 
 2. Deterministic rendezvous in a ring
 Introduction
 A single stationary token
 The feasibility of rendezvous
 The time complexity of rendezvous
 Memory tradeoff for rendezvous with detection
 Limits to the memory tradeoff
 Movable tokens
 Comments and bibliographic remarks 
 3. Multiple agent rendezvous in a ring
 Introduction
 Impossibility of rendezvous
 Rendezvous with detection
 Conditional solutions
 Comments and bibliographic remarks 
 4. Randomized rendezvous in a ring
 Introduction
 Random walk algorithm
 Randomization and tokens
 Time/memory tradeoffs
 Coin half tour algorithm
 Approximate counting algorithm
 Comments and bibliographic remarks 
 5. Other models
 Introduction
 Leader election and rendezvous
 Rendezvous with failing tokens
 Rendezvous when tokens fail upon release
 Rendezvous when tokens can fail at any time
 The cost of token failure
 Flickering tokens
 Asynchronous rendezvous
 Lookcomputemove
 Model and terminology
 Impossibility results
 Gathering configurations with a single multiplicity
 Gathering rigid configurations
 Gathering an odd number of robots
 Dangerous networks
 Blackhole search in an asynchronous ring
 Rendezvous in asynchronous rings in spite of a blackhole
 Comments and bibliographic remarks 
 6. Other topologies
 Introduction
 Synchronous torus
 Memory lower bounds for rendezvous
 Rendezvous algorithms
 Trees
 Arbitrary graphs
 Comments and bibliographic remarks 
 Bibliography
 Glossary
 Authors' biographies
 Index.
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.