arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.3286cs.AI
收藏

算法组合设计的新技术

New Techniques for Algorithm Portfolio Design

Carnegie Mellon University(卡内基梅隆大学);The Robotics Institute(机器人研究所)

Matthew Streeter, Stephen F. Smith

摘要:

我们提出并评估新的技术设计算法组合。在我们看来,这个问题既有调度方面,也有机器学习方面。先前的工作主要是孤立地解决这两个方面中的一个。最近的工作调度方面的问题的基础上,我们提出了一种技术,同时解决这两个方面,有吸引力的理论保证。实验上,我们表明,这种技术可以用来提高性能的最先进的算法布尔可满足性,零一整数规划,和AI。规划

英文摘要:

We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has largely addressed one of the two aspects in isolation. Building on recent work on the scheduling aspect of the problem, we present a technique that addresses both aspects simultaneously and has attractive theoretical guarantees. Experimentally, we show that this technique can be used to improve the performance of state-of-the-art algorithms for Boolean satisfiability, zero-one integer programming, and A.I. planning.

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

↑