Cerca
Ara es mostren els items 1-2 de 2
Subproblem ordering heuristics for AND/OR best-first search
(2017-11-09)
Article.
Accés obert
Article.
Accés obert
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 ...
Residual-guided look-ahead in AND/OR search for graphical models
(2017-10-01)
Article.
Accés obert
Article.
Accés obert
We introduce the concept of local bucket error for the mini-bucket heuristics and show how it can be used to improve the power of AND/OR search for combinatorial optimization tasks in graphical models (e.g. MAP/MPE or ...