Towards parallel search for optimization in graphical models

11th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2010

Volumn , Issue , 2010, Pages

  Otten, Lars ^a   Dechter, Rina ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AND/OR GRAPH SEARCHES; BRANCH-AND-BOUND ALGORITHMS; GRAPHICAL MODEL; HAPLOTYPING; MASTER PROCESS; PARALLEL SEARCH; PARALLELIZATIONS; PARALLELIZING; PROBLEM INSTANCES; SEQUENTIAL SEARCH ALGORITHM; SUB-PROBLEMS; UNDERLYING GRAPHS; WORKER NODES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; GRAPHIC METHODS; LINEAR PROGRAMMING;

OPTIMIZATION;

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

References (10)

1. Dechter, R., and Mateescu, R. 2007. AND/OR search spaces for graphical models. Artificial Intelligence 171(2-3):73-106.
2. Dechter, R., and Rish, I. 2003. Mini-buckets: A general scheme for bounded inference. Journal of the ACM 50(2):107-153.
3. Dechter, R. 1990. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence 41(3):273-312.
4. Fishelson, M.; Dovgolevsky, N.; and Geiger, D. 2005. Maximum likelihood haplotyping for general pedigrees. Human Heredity 59:41-60.
5. Gendron, B., and Crainic, T. G. 1994. Parallel branchand-bound algorithms: Survey and synthesis. Operations Research 42(6):1042-1066.
6. Marinescu, R., and Dechter, R. 2009. AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. Artificial Intelligence 173(16-17):1457-1491.
7. Mateescu, R., and Dechter, R. 2005. AND/OR cutset conditioning. In 19th International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, 230-235.
8. Otten, L., and Dechter, R. 2008. Refined bounds for instance-based search complexity of counting and other #P problems. In CP, 576-581.
9. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann.
10. Thain, D.; Tannenbaum, T.; and Livny, M. 2005. Distributed computing in practice: the Condor experience. Concurrency - Practice and Experience 17(2-4):323-356.