J. , L. Snell-charles, and M. Grinstead, Introduction to Probability : Second Revised Edition, chapter 11, 1997.

P. Flajolet and R. Sedgewick, Analytics combinatorics. preprint disponible sur http

F. Glover and S. Hanafi, Tabu search and finite convergence, Discrete Applied Mathematics, vol.119, issue.1-2, pp.3-36, 2002.
DOI : 10.1016/S0166-218X(01)00263-3

URL : http://doi.org/10.1016/s0166-218x(01)00263-3

V. Hernandez, J. E. Roman, and V. Vidal, SLEPc, ACM Transactions on Mathematical Software, vol.31, issue.3, pp.351-362, 2005.
DOI : 10.1145/1089014.1089019

H. Holger and . Hoos, On the run-time behaviour of stochastic local search algorithms for SAT, Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI'99, pp.661-666, 1999.

H. Holger, T. Hoos, and . Stutzle, Local search algorithms for SAT : An empirical evaluation, Journal of Automated Reasoning, vol.24, issue.4, pp.421-481, 2000.

X. Bhaskar-krishnamachari, B. Xie, S. Selman, and . Wicker, Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing, Proceedings of 6th Intl. Conference on the Principles and Practice of Constraint Programming, 1894.
DOI : 10.1007/3-540-45349-0_21

. Damiennogù-es, Walksat et cha??nescha??nes de markov, 2007.

B. Selman, H. A. Kautz, and B. Cohen, Noise strategies for improving local search, Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94), pp.337-343, 1994.

B. Selman, H. J. Levesque, and D. Mitchell, A new method for solving hard satisfiability problems, Proceedings of the Tenth National Conference on Artificial Intelligence, pp.440-446, 1992.