About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISAIM 2014
Conference paper
Weighted best first search for MAP
Abstract
The paper considers Weighted Best First (WBF) search schemes, popular for path-finding domain, as approximations and as anytime schemes for the MAP task. We demonstrate empirically the ability of these schemes to effectively provide approximations with guaranteed suboptimality and also show that as anytime schemes they can be competitive on some benchmarks with one of the best state-of-the-art scheme, Depth-First Branch-and-Bound.