How Do Mobile Agents Benefit from Randomness?

DOI10.1007/978-3-030-91081-5_7zbMath1521.68056MaRDI QIDQ6488433

Pierre Fraigniaud

Publication date: 21 April 2023

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• How many ants does it take to find the food?
• The ANTS problem
• Searching without communicating: tradeoffs between performance and selection complexity
• Distributed House-Hunting in Ant Colonies
• Networks Become Navigable as Nodes Move and Forget
• Space Lower Bounds for Maze Threadability on Restricted Machines
• Solving the ANTS Problem with Asynchronous Finite State Machines
• Ant-Inspired Density Estimation via Random Walks

This page was built for publication: How Do Mobile Agents Benefit from Randomness?