Bounding Search Space Size via (Hyper)tree Decompositions

13 years 8 months ago
Bounding Search Space Size via (Hyper)tree Decompositions
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.
Lars Otten, Rina Dechter
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where UAI
Authors Lars Otten, Rina Dechter
Comments (0)