Optimizing searches via rare events.
暂无分享,去创建一个
Randomized search algorithms for hard combinatorial problems exhibit a large variability of performances. We study the different types of rare events which occur in such out-of-equilibrium stochastic processes and we show how they cooperate in determining the final distribution of running times. As a by-product of our analysis we show how search algorithms are optimized by random restarts.
[1] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[2] H. Nishimori. Statistical Physics of Spin Glasses and Information Processing , 2001 .