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

通过模型分裂的分布式求解

Distributed solving through model splitting

University of St Andrews(圣安德鲁斯大学)

Lars Kotthoff, Neil C. A. Moore

摘要:

约束问题可以通过同时探索搜索树的不同分支来并行解决。以前的方法集中在求解器中实现此功能,或多或少对用户是透明的。我们提出了一种新的方法,它修改了约束模型的问题。现有的模型被分割成新的模型,新的模型添加了划分搜索空间的约束。可选地,附加的约束被施加以排除已经完成的搜索。我们的方法的优点是,它可以很容易地实现,计算可以停止和重新启动,移动到不同的机器上,并确实解决了机器上是无法相互通信。

英文摘要:

Constraint problems can be trivially solved in parallel by exploring different branches of the search tree concurrently. Previous approaches have focused on implementing this functionality in the solver, more or less transparently to the user. We propose a new approach, which modifies the constraint model of the problem. An existing model is split into new models with added constraints that partition the search space. Optionally, additional constraints are imposed that rule out the search already done. The advantages of our approach are that it can be implemented easily, computations can be stopped and restarted, moved to different machines and indeed solved on machines which are not able to communicate with each other at all.

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

↑