Parallel Bayesian search with no coordination

DOI10.1145/3304111MaRDI QIDQ5244389zbMATH OpenOpenAlexWikidataFDO

Authors Pierre Fraigniaud, Amos Korman, Yoav Rodeh

Publication date 21 November 2019

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3304111

zbMATH Keywords

Bayesian searchdistributed computingfault toleranceparallel computingrandomized algorithmstreasure hunt

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Parallel search with no coordination
• Parallel exhaustive search without coordination
• Optimal distributed searching in the plane with and without uncertainty
• Physical search problems with probabilistic knowledge
• Treasure hunt with barely communicating agents

Cited in

(7)

• Parallel search with no coordination
• Weighted group search on a line \& implications to the priority evacuation problem
• Multi-round cooperative search games with multiple players
• Multi-round cooperative search games with multiple players
• Multi-agent search in a set: distribution of effort and estimating the efficiency
• Parallel exhaustive search without coordination
• Algorithms for \(p\)-Faulty Search on a half-line

This page was built for publication: Parallel Bayesian search with no coordination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244389)