Best-first AND/OR search for graphical models

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1171-1176

  Marinescu, Radu ^a   Dechter, Rina ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUND ALGORITHMS; GRAPHICAL MODELS; SEARCH ALGORITHMS; TIME SAVINGS;

ALGORITHMS; BENCHMARKING; CONTROL THEORY; GRAPHIC METHODS; MATHEMATICAL MODELS; TREES (MATHEMATICS);

LOGIC GATES;

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

References (16)

1. Bensana, E.; Lemaitre, M.; and Verfaillie, G. 1999. Earth observation satellite management. Constraints 4(3):293-299.
2. Chakrabati, P.; Ghose, S.; Acharya, A.; and de Sarkar, S. 1989. Heuristic search in restricted memory. In Artificial Intelligence 3(41): 197-221.
3. de Givry, S.; Heras, F.; Larrosa, J.; and Zytnicki, M. 2005. Existential arc consistency: getting closer to full arc consistency in weighted csps. In IJCAI.
4. Dechter, R., and Mateescu, R. 2006. And/or search spaces for graphical models. Artificial Intelligence.
5. Dechter, R., and Pearl, J. 1985. Generalized best-first search strategies and the optimality of a*. In Journal of ACM 32(3):505-536.
6. Dechter, R. 2003. Constraint Processing. MIT Press.
7. Fishelson, M., and Geiger, D. 2002. Exact genetic linkage computations for general pedigrees. Bioinformatics.
8. Freuder, E., and Quinn, M. 1985. Taking advantage of stable sets of variables in constraint satisfaction problems. In IJCAI 1076-1078.
9. Leyton-Brown, K.; Pearson, M.; and Shoham, Y. 2000. Towards a universal test suite for combinatorial auction algorithms. In ACM Electronic Commerce 66-76.
10. Marinescu, R., and Dechter, R. 2005. And/or branch-and-bound for graphical models. In IJCAI 224-229.
11. Marinescu, R., and Dechter, R. 2006a. And/or branch-and-bound search for pure 0/1 integer linear programming problems. In CPAIOR 152-166.
12. Marinescu, R., and Dechter, R. 2006b. Dynamic orderings for and/or branch-and-bound search in graphical models. In ECAI 138-142.
13. Marinescu, R., and Dechter, R. 2006c. Memory intensive branch-and-bound search for graphical models. In AAAI.
14. Nemhauser, G., and Wolsey, L. 1988. Integer and combinatorial optimization. Wiley.
15. Nillson, K. 1980. Principles of Artificial Intelligence. Tioga.
16. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems. Morgan-Kaufmann.