AND/OR Branch-and-Bound search for combinatorial optimization in graphical models

&
Artificial Intelligence 173 (16-17):1457-1491 (2009)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2009.07.003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,897

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Memory intensive AND/OR search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1492-1524.
AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.
Importance sampling-based estimation over AND/OR search spaces for graphical models.Vibhav Gogate & Rina Dechter - 2012 - Artificial Intelligence 184-185 (C):38-77.
Unifying tree decompositions for reasoning in graphical models.Kalev Kask, Rina Dechter, Javier Larrosa & Avi Dechter - 2005 - Artificial Intelligence 166 (1-2):165-193.
Cut-and-solve: An iterative search strategy for combinatorial optimization problems.Sharlee Climer & Weixiong Zhang - 2006 - Artificial Intelligence 170 (8-9):714-738.
Optimization Methods for Logical Inference.Vijay Chandru & John Hooker - 1999 - University of Texas Press.
Theory Unification and Graphical Models in Human Categorization.David Danks - 2010 - Causal Learning:173--189.
Unifying the mind: Cognitive Representations as Graphical Models. [REVIEW]Christopher Burr - 2016 - Philosophical Psychology 29 (5):789-791.
Wiring optimization explanation in neuroscience.Sergio Daniel Barberis - 2019 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 34 (1):89-110.
Data Driven Methods for Granger Causality and Contemporaneous Causality with Non-Linear Corrections: Climate Teleconnection Mechanisms.T. Chu & D. Danks - unknown
Data driven methods for Granger causality and contemporaneous causality with non-linear corrections: Climate teleconnection mechanisms.Clark Glymour - unknown
N − 1 Experiments Suffice to Determine the Causal Relations Among N Variables.Frederick Eberhardt, Clark Glymour & Richard Scheines - unknown
Wiring optimization explanation in neuroscience: What is Special about it?Sergio Daniel Barberis - 2019 - Theoria : An International Journal for Theory, History and Fundations of Science 1 (34):89-110.
Safe Bounds in Semidefinite Programming by Using Interval Arithmetic.Orkia Derkaoui - 2014 - American Journal of Operations Research 4:293-300.
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures.Vipin Kumar & Laveen N. Kanal - 1983 - Artificial Intelligence 21 (1-2):179-198.

Analytics

Added to PP
2020-12-22

Downloads
12 (#1,085,611)

6 months
10 (#268,496)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.

View all 11 references / Add more references