Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
From MaRDI portal
Publication:4909402
DOI10.1007/978-3-642-33651-5_5zbMath1321.68415arXiv1205.4545OpenAlexW1844529830MaRDI QIDQ4909402
Publication date: 13 March 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.4545
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Animal behavior (92D50) Distributed algorithms (68W15)
Related Items
Collaboration Without Communication: Evacuating Two Robots from a Disk, Querying with Uncertainty, Treasure Hunt with Advice, Lower and upper competitive bounds for online directed graph exploration, The ANTS problem, Searching without communicating: tradeoffs between performance and selection complexity, ANTS on a Plane, Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication, How many ants does it take to find the food?, The Synergy of Finite State Machines, An algorithmic approach to collective behavior, Two-agent tree evacuation