Work

On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds

Year: 2016

Type: book-chapter

Abstract: Best-first search can be regarded as anytime scheme for producing lower bounds on the optimal solution, a characteristic that is mostly overlooked. We explore this topic in the context of AND/OR best-first search, guided by the MBE heuristic, when solving graphical models. In that context, the impact of the secondary heuristic for subproblem ordering may be significant, especially in the anytime context. Indeed, our paper illustrates this, showing that the new concept of bucket errors can advise in providing effective subproblem orderings in AND/OR search.

Source: Frontiers in artificial intelligence and applications

DOI: 10.3233/978-1-61499-672-9-1567

Authors: Lam William, Kask Kalev, Dechter Rina, Larrosa Javier

Institutions: University of California, Irvine, Universitat Politècnica de Catalunya

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W2579313498

FWCI:

Cites: 4

Cited by:

Related to: 10