Vés al contingut (premeu Retorn)

Subproblem ordering heuristics for AND/OR best-first search

Lam, W.; Kask, K.; Larrosa, J.; Dechter, R.
Tipus d'activitat
Article en revista
Journal of computer and system sciences
Data de publicació
DOI Obrir en finestra nova
Repositori Obrir en finestra nova
URL Obrir en finestra nova
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 a new concept of bucket errors can advise i...
Lam, W., Kask, K., Larrosa, J., Dechter, R. Subproblem ordering heuristics for AND/OR best-first search. "Journal of computer and system sciences", 9 Novembre 2017.
Paraules clau
Artificial Intelligence, Graphical Models, Heuristic Search
Grup de recerca
LOGPROG - Lògica i Programació