Andrea Montanari1, Riccardo Zecchina
1Laboratoire de Physique Théorique de l'ENS, 24 rue Lhomond, 75231 Paris cedex 05, France. montanar@lpt.ens.fr
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Randomized search algorithms for complex problems have variable performance. Rare events in these stochastic processes determine running times, and random restarts optimize algorithm performance.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: