Subproblem ordering heuristics for AND/OR best-first search
Visualitza/Obre
Cita com:
hdl:2117/111987
Tipus de documentArticle
Data publicació2017-11-09
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
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 a new concept of bucket errors can advise in providing effective subproblem orderings in AND/OR search for both exact and anytime solutions.
CitacióLam, W., Kask, K., Larrosa, J., Dechter, R. Subproblem ordering heuristics for AND/OR best-first search. "Journal of computer and system sciences", Juny 2018, vol. 94, p. 41-62.
ISSN0022-0000
Versió de l'editorhttp://www.sciencedirect.com/science/article/pii/S0022000017302118
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
JCSS.pdf | 1,609Mb | Visualitza/Obre |