paper

Boosting search by rare events

arXiv:cond-mat/0112142 · doi:10.1103/PhysRevLett.88.178701

Abstract

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 byproduct of our analysis we show how search algorithms are optimized by random restarts.

4 pages, 3 eps figures. References updated

References in corpus (1)

Cited by in corpus (100)