arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1210.4890cs.AI
收藏

影响图近似求解的复杂性

The Complexity of Approximately Solving Influence Diagrams

IDSIA(IDSIA(瑞士人工智能研究所))

Denis D. Maua, Cassio Polpo de Campos, Marco Zaffalon

摘要:

影响图可以直观而精确地描述涉及不确定性决策的复杂情况。不幸的是,影响图描述的大多数问题都很难解决。本文讨论了近似求解影响图的复杂性。我们不假设不遗忘或规律性,这使得我们解决的问题非常广泛。值得注意的是,我们表明,当树的宽度和基数的变量是有界的问题承认一个完全多项式时间近似计划。

英文摘要:

Influence diagrams allow for intuitive and yet precise description of complex situations involving decision making under uncertainty. Unfortunately, most of the problems described by influence diagrams are hard to solve. In this paper we discuss the complexity of approximately solving influence diagrams. We do not assume no-forgetting or regularity, which makes the class of problems we address very broad. Remarkably, we show that when both the tree-width and the cardinality of the variables are bounded the problem admits a fully polynomial-time approximation scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑