Scheduling search procedures: The wheel of fortune

DOI10.1007/S10951-006-8788-YzbMath1154.90435OpenAlexW1985343812MaRDI QIDQ880568

Peter Damaschke

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-8788-y

zbMATH Keywords

Game theorySearchingNonclairvoyant scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Ranking hypotheses to minimize the search cost in probabilistic inference models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Nonclairvoyant scheduling
• Complexity of searching an immobile hider in a graph
• On the optimality of a simple strategy for searching graphs
• Scheduling search procedures
• The Theory of Search: Optimum Distribution of Search Effort
• Online Parallel Heuristics and Robot Searching under the Competitive Framework
• Beyond Competitive Analysis
• Fundamentals of Computation Theory

This page was built for publication: Scheduling search procedures: The wheel of fortune