Trade-offs between selection complexity and performance when searching the plane without communication
Publication:2943625
DOI10.1145/2611462.2611463zbMath1321.68480arXiv1405.1688MaRDI QIDQ2943625
Christoph Lenzen, Calvin Newport, Tsvetomira Radeva, Nancy A. Lynch
Publication date: 3 September 2015
Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.1688
Markov chains; search algorithms; distributed algorithms; mobile agents; biology-inspired algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W15: Distributed algorithms
Related Items