Querying with Uncertainty

DOI10.1007/978-3-319-72751-6_7zbMath1503.68053OpenAlexW2779948334MaRDI QIDQ5056054

Kostantinos Georgiou, Evangelos Kranakis, Huda Chuangpishit

Publication date: 9 December 2022

Published in: Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-72751-6_7

zbMATH Keywords

optimizationpartitionrandom walkassignmentsearchingquerying

Mathematics Subject Classification ID

Searching and sorting (68P10) Artificial intelligence for robotics (68T40) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• An annotated bibliography on guaranteed graph searching
• Memoryless search algorithms in a network with faulty advice
• Theory of optimal search
• The theory of search games and rendezvous.
• On the linear search problem
• The return of the linear search problem
• How to learn an unknown environment. I
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
• Optimal Constructions of Hybrid Algorithms
• Search on a Line by Byzantine Robots
• Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
• Nearest-Neighbor Searching Under Uncertainty II
• Group Search on the Line
• Locating a target with an agent guided by unreliable local advice
• Search on a Line with Faulty Robots

This page was built for publication: Querying with Uncertainty