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

算法组合设计:理论与实践

Algorithm Portfolio Design: Theory vs. Practice

Rome Laboratory(罗马实验室);AT&T Bell Laboratories(AT&T贝尔实验室)

Carla P. Gomes, Bart Selman

摘要:

随机算法是解决计算困难的搜索和推理问题的最佳算法之一。这种过程的运行时间的特征在于随机变量。不同的算法产生不同的概率分布。人们可以通过将几种算法组合到一个组合中,并在单个处理器上并行或交错运行它们来利用这些差异。我们提供了一个详细的评估组合方法的分布硬组合搜索问题。我们展示了在什么条件下的protestant方法可以有一个戏剧性的计算优势,最好的传统方法。

英文摘要:

Stochastic algorithms are among the best for solving computationally hard search and reasoning problems. The runtime of such procedures is characterized by a random variable. Different algorithms give rise to different probability distributions. One can take advantage of such differences by combining several algorithms into a portfolio, and running them in parallel or interleaving them on a single processor. We provide a detailed evaluation of the portfolio approach on distributions of hard combinatorial search problems. We show under what conditions the protfolio approach can have a dramatic computational advantage over the best traditional methods.

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

↑