Best-First AND/OR Search for Graphical Models

  title={Best-First AND/OR Search for Graphical Models},
  author={Radu Marinescu and Rina Dechter},
The paper presents and evaluates the power of best-first searchover AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to the structure of the graphical model, which can translate into significant time savings. Indeed, in recent years depth-first AND/OR Branch-and-Bound algorithms were shown to be very effective when exploring such search spaces, especially when using caching. Since best-first strategies are known to be superior to depth… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS