]. A. Auger, M. Jebalia, and O. Teytaud, Xse: quasi-random mutations for evolution strategies, Proceedings of Evolutionary Algorithms, 2005.

A. Auger, M. Schoenauer, and O. Teytaud, Local and global order 3/2 convergence of a surrogate evolutionary algorithm, Proceedings of the 2005 conference on Genetic and evolutionary computation , GECCO '05, pp.857-864, 2005.
DOI : 10.1145/1068009.1068154

H. Beyer, The Theory of Evolutions Strategies, 2001.
DOI : 10.1007/978-3-662-04378-3

P. Bratley and B. Fox, ALGORITHM 659: implementing Sobol's quasirandom sequence generator, ACM Transactions on Mathematical Software, vol.14, issue.1, pp.88-100, 1988.
DOI : 10.1145/42288.214372

C. Cervellera and M. Muselli, A Deterministic Learning Approach Based on Discrepancy, Proceedings of WIRN'03, pp.53-60, 2003.
DOI : 10.1007/978-3-540-45216-4_5

A. Conn, K. Scheinberg, and L. Toint, Recent progress in unconstrained nonlinear optimization without derivatives, Mathematical Programming, vol.12, issue.1, 1997.
DOI : 10.1007/BF02614326

A. Eiben and J. Smith, Introduction to Evolutionary Computing, 2003.

S. Gelly, J. Mary, and O. Teytaud, On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy, 10 th International Conference on Parallel Problem Solving from Nature, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00112816

N. I. Gould, D. Orban, and P. L. Toint, CUTEr and SifDec, ACM Transactions on Mathematical Software, vol.29, issue.4, pp.373-394, 2003.
DOI : 10.1145/962437.962439

J. Halton, On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals, Numerische Mathematik, vol.38, issue.1, pp.84-90, 1960.
DOI : 10.1007/BF01386213

N. Hansen and A. Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, vol.9, issue.2, 2003.
DOI : 10.1016/0004-3702(95)00124-7

S. Kimura and K. Matsumura, Genetic algorithms using low-discrepancy sequences, Proceedings of the 2005 conference on Genetic and evolutionary computation , GECCO '05, pp.1341-1346, 2005.
DOI : 10.1145/1068009.1068225
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.7495

P. L. Ecuyer and C. Lemieux, Recent advances in randomized quasi-monte carlo methods, 2002.

H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, 1992.
DOI : 10.1137/1.9781611970081

A. Owen, Quasi-Monte Carlo Sampling, A Chapter, 2003.

I. Rechenberg, Evolutionstrategie: Optimierung Technisher Systeme nach Prinzipien des Biologischen Evolution, 1973.

P. Sarkar and M. Prasad, A comparative study of pseudo and quasi random sequences for the solution of integral equations, Journal of Computational Physics, vol.68, issue.1, pp.66-88, 1978.
DOI : 10.1016/0021-9991(87)90045-3

I. Sloan and H. Wo´zniakowskiwo´zniakowski, When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?, Journal of Complexity, vol.14, issue.1, pp.1-33, 1998.
DOI : 10.1006/jcom.1997.0463
URL : http://doi.org/10.1006/jcom.1997.0463

I. M. Sobol, On the Systematic Search in a Hypercube, SIAM Journal on Numerical Analysis, vol.16, issue.5, pp.790-793, 1979.
DOI : 10.1137/0716058

P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y. Chen et al., Problem definitions and evaluation criteria for the cec 2005 special session on real-parameter optimization, 2005.

T. Back, F. Hoffmeister, and H. Schewefel, A survey of evolution strategies, p.4600, 1991.

B. Tuffin, On the use of low discrepancy sequences in Monte Carlo methods, Monte Carlo Methods and Applications, vol.2, issue.4, 1996.
DOI : 10.1515/mcma.1996.2.4.295