Bounding Search Space Size via (Hyper)tree Decompositions
Artificial Intelligence
2012-06-18 v1
Abstract
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to the recent notion of hypertree decompositions allows to exploit determinism in the problem specification and produce tighter bounds. We demonstrate on a variety of practical problem instances that we are often able to improve upon existing bounds by several orders of magnitude.
Cite
@article{arxiv.1206.3284,
title = {Bounding Search Space Size via (Hyper)tree Decompositions},
author = {Lars Otten and Rina Dechter},
journal= {arXiv preprint arXiv:1206.3284},
year = {2012}
}
Comments
Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial Intelligence (UAI2008)