Loading...
Loading...

Go to the content (press return)

On the impact of subproblem orderings on anytime AND/OR best-first search for lower bounds

Author
Lam, W.; Kask, K.; Dechter, R.; Larrosa, J.
Type of activity
Presentation of work at congresses
Name of edition
22nd European Conference on Artificial Intelligence
Date of publication
2016
Presentation's date
2016-08-29
Book of congress proceedings
ECAI 2016: 22nd European Conference on Artificial Intelligence: 29 August–2 September 2016, The Hague, The Netherlands: proceedings
First page
1567
Last page
1568
DOI
10.3233/978-1-61499-672-9-1567
Project funding
Logic-Based Smart Solutions
URL
http://ebooks.iospress.com/volumearticle/44923 Open in new window
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...
Group of research
LOGPROG - Logic and Programming

Participants

  • Lam, William  (author and speaker )
  • Kask, Kalev  (author and speaker )
  • Dechter, Rina  (author and speaker )
  • Larrosa Bondia, Francisco Javier  (author and speaker )