期刊
PHYSICAL REVIEW LETTERS
卷 86, 期 23, 页码 5219-5222出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.86.5219
关键词
-
Finding the ground state of a system with a complex energy landscape is important for-many physical problems including protein folding, spin glasses, chemical clusters, and neural networks. Such problems are usually solved by heuristic search methods whose efficacy is judged by empirical performance on selected examples. We present a proof that, within the large class of algorithms that simulate a random walk on the landscape, threshold accepting is the best possible strategy. In particular, it can perform better than simulated annealing and Tsallis statistics. Our proof is the first example of a provably optimal strategy in this area.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据