用分支定界搜索法求解多级影响图
Solving Multistage Influence Diagrams using Branch-and-Bound Search
摘要：
以前在文献中已经提出了一种求解影响图的分支定界方法，但似乎从未被实施和评估-显然是由于计算分支定界搜索的有效边界的困难。在本文中，我们描述了如何有效地计算有效的边界，我们开发了一个实际的实现的深度优先分支定界搜索的影响图评估，优于现有的方法，解决多阶段的影响图。
英文摘要：
A branch-and-bound approach to solving influ- ence diagrams has been previously proposed in the literature, but appears to have never been implemented and evaluated - apparently due to the difficulties of computing effective bounds for the branch-and-bound search. In this paper, we describe how to efficiently compute effective bounds, and we develop a practical implementa- tion of depth-first branch-and-bound search for influence diagram evaluation that outperforms existing methods for solving influence diagrams with multiple stages.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
