Approximation Algorithms for Max-Sum-Product Problems

摘要：

　　Many tasks in probabilistic reasoning can be cast as max-sum-product problems,a hard class of combinatorial problems.We describe our results in obtaining a new approximation scheme for the problem,that can be turned into an anytime procedure.For many tasks,this scheme can be shown to be asymptotically the best possible heuristic.

作者: Denis D. Mauá

作者单位: Istituto “Dalle Molle di Studi sulIntelligenza Artificiale(IDSIA)Switzerland

会议类型: 国际会议

会议名称: 2013年第23届人工智能国际会议(IJCAI-2013)

会议地点: 北京

会议语种:英文

页码: 3235-3236

在线出版日期: 2013-08-01（万方平台首次上网日期，不代表论文的发表时间）