arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0709.1023quant-phcond-mat.stat-mechcs.CCnlin.AO
收藏

约束优化和景观

Constraint optimization and landscapes

Florent Krzakala, Jorge Kurchan

摘要:

我们描述了[1]中引入的用于分析约束满足问题的有效景观,例如球体填充,K-SAT和图着色。这种几何结构重新表达了这些问题,在崎岖的能源景观更熟悉的优化条款。特别是,它允许一个令人费解的事实,即简单的程序是成功的远远超出了被认为是“硬”的过渡,并建议一个算法定义一个新的,更高的,容易硬的前沿。

英文摘要:

We describe an effective landscape introduced in [1] for the analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring. This geometric construction reexpresses these problems in the more familiar terms of optimization in rugged energy landscapes. In particular, it allows one to understand the puzzling fact that unsophisticated programs are successful well beyond what was considered to be the `hard' transition, and suggests an algorithm defining a new, higher, easy-hard frontier.

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

↑