Memory intensive AND/OR search for combinatorial optimization in graphical models

@article{Marinescu2009MemoryIA,
  title={Memory intensive AND/OR search for combinatorial optimization in graphical models},
  author={Radu Marinescu and Rina Dechter},
  journal={Artif. Intell.},
  year={2009},
  volume={173},
  pages={1492-1524}
}
In this paper we explore the impact of caching on search in the context of th e recent framework of AND/OR search in graphical models. Specifically, we extend he depth-first AND/OR Branch-and-Boundtree searchalgorithm to explore an AND/OR search graph by equipping it with an adaptive caching scheme similar to good and no-good r ec rding. Furthermore, we present best-firstsearch algorithms for traversing the same underlying AND/OR search graph and compare both depth-first and best-first app ro… CONTINUE READING
Highly Cited
This paper has 64 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

64 Citations

0510'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 53 references

Value elimination: Bayesian infere c via backtracking search

F. Bacchus, S. Dalmao, T. Pittasi
InUncertainty in Artificial Intelligence (UAI) , pages 20–28, • 2003
View 11 Excerpts
Highly Influenced

Recursive conditioning

Artif. Intell. • 2001
View 7 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…