Ranking hypotheses to minimize the search cost in probabilistic inference models

DOI10.1016/j.dam.2007.12.006zbMath1183.68225OpenAlexW2115261756MaRDI QIDQ1025988

Peter Damaschke

Publication date: 23 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.12.006

zbMATH Keywords

linear programmingrankingpolytopesprobabilistic inferencesearchingmixed strategy

Mathematics Subject Classification ID

Searching and sorting (68P10) Linear programming (90C05)

Cites Work

• 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
• Scheduling search procedures: The wheel of fortune
• The number of cycle lengths in graphs of given minimum degree and girth
• Complexity of searching an immobile hider in a graph
• On the optimality of a simple strategy for searching graphs
• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Scheduling search procedures
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• Optimal Constructions of Hybrid Algorithms
• A Note on Bipartite Graphs Without 2 k -Cycles
• The ultimate strategy to search on \(m\) rays?

This page was built for publication: Ranking hypotheses to minimize the search cost in probabilistic inference models