通过（超）树分解限定搜索空间大小
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
