Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models

  • Authors:

  • Radu Marinescu;Rina Dechter

  • Affiliations:

  • University of California, Irvine, USA, email: {radum,dechter}@ics.uci.edu;University of California, Irvine, USA, email: {radum,dechter}@ics.uci.edu

  • Venue:
  • Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. Since the variable selection can have a dramatic impact on search performance when solving optimization tasks, we introduce in this paper a new dynamic AND/OR Branch-and-Bound algorithmic framework which accommodates variable ordering heuristics. The efficiency of the dynamic AND/OR approach is demonstrated empirically in a variety of domains.