Querying with Uncertainty

DOI10.1007/978-3-319-72751-6_7MaRDI QIDQ5056054zbMATH OpenOpenAlexFDO

Authors Kostantinos Georgiou, H. Chuangpishit, Evangelos Kranakis

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

assignmentoptimizationpartitionqueryingrandom walksearching

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for queryable uncertainty
• scientific article; zbMATH DE number 4062645
• Survey on query processing based on uncertain data
• Ranking queries on uncertain data.

Cites work

• An annotated bibliography on guaranteed graph searching
• Group search on the line
• How to learn an unknown environment. I
• scientific article; zbMATH DE number 4057247 (Why is no real title available?)
• Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock?
• Memory lower bounds for randomized collaborative search and implications for biology
• Memoryless search algorithms in a network with faulty advice
• Nearest-neighbor searching under uncertainty. II
• On the linear search problem
• Optimal Constructions of Hybrid Algorithms
• Search on a line by Byzantine robots
• Search on a line with faulty robots
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
• The return of the linear search problem
• The theory of search games and rendezvous.
• Theory of optimal search

This page was built for publication: Querying with Uncertainty

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