Memory intensive branch-and-bound search for graphical models

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1200-1205

  Marinescu, Radu ^a   Dechter, Rina ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHICAL MODELS; SEARCH ALGORITHMS; SEARCH TREES;

ARTIFICIAL INTELLIGENCE; COMPUTER GRAPHICS; DATA STRUCTURES; LEARNING ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION;

ONLINE SEARCHING;

EID: 33750691345     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Bacchus, F.; Dalmao, S.; and Pittasi, T. 2003. Value elimination: Bayesian inference via backtracking search. In UAI, 20-28.
2. Bayardo, R., and Miranker, D. 1995. On the space-time trade-off in solving constraint satisfaction problems. In IJCAI, 558-562.
3. Bensana, E.; Lemaitre, M.; and Verfaillie, G. 1999. Earth observation satellite management. Constraints 4(3):293-299.
4. Darwiche, A. 2001. Recursive conditioning. Artificial Intelligence 126(1-2):5-41.
5. de Givry, S.; Heras, R; Larrosa, J.; and Zytnicki, M. 2005. Existential arc consistency: getting closer to full arc consistency in weighted csps. In IJCAI, 84-89.
6. Dechter, R., and Mateescu, R. 2004. Mixtures of deterministic- probabilistic networks. In UAI, 120-129.
7. Dechter, R., and Rish, I. 2003. Mini-buckets: A general scheme for approximating inference. J. ACM.
8. Dechter, R. 2003. Constraint Processing. MIT Press.
9. Fishelson, M., and Geiger, D. 2002. Exact genetic linkage computations for general pedigrees. Bioinformatics.
10. Freuder, E., and Quinn, M. 1985. Taking advantage of stable sets of variables in constraint satisfaction problems. In IJCAI, 1076-1078.
11. Jegou, P., and Terrioux, C. 2004. Decomposition and good recording for solving max-csps. In ECAI, 196-200.
12. Kanal, L., and Kumar, V. 1988. Search in artificial intelligence. Springer-Verlag.
13. Kask, K., and Dechter, R. 2001. A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence 129:91-131.
14. Marinescu, R., and Dechter, R. 2005. And/or branch-and-bound for graphical models. In IJCAI, 224-229.
15. Mateescu, R., and Dechter, R. 2005. And/or cutset conditioning. In IJCAI, 230-235.
16. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems. Morgan-Kaufmann.