most citedBounding Search Space Size via (Hyper)tree Decompositions

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

cs.AI2012★ 4 cited

Bounding Search Space Size via (Hyper)tree Decompositions

Lars Otten, Rina Dechter

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 t…