Exploring an Infinite Space with Finite Memory Scouts

DOI10.1137/1.9781611974782.14zbMath1411.68078arXiv1704.02380OpenAlexW2950596576MaRDI QIDQ4575750

Jara Uitto, Lihi Cohen, Yuval Emek, Oren Louidor

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.02380

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Random walks on graphs (05C81) Agent technology and artificial intelligence (68T42)

Related Items (11)

Unnamed Item ⋮ Constant space and non-constant time in distributed computing ⋮ Algorithms for \(p\)-Faulty Search on a half-line ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Building a nest by an automaton ⋮ Unnamed Item ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ The Synergy of Finite State Machines ⋮ Exploration of High-Dimensional Grids by Finite Automata ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Weighted group search on a line \& implications to the priority evacuation problem

This page was built for publication: Exploring an Infinite Space with Finite Memory Scouts