A. Auger and N. Hansen, A Restart CMA Evolution Strategy With Increasing Population Size, 2005 IEEE Congress on Evolutionary Computation, pp.1769-1776, 2005.
DOI : 10.1109/CEC.2005.1554902

A. Auger, M. Jebalia, and O. Teytaud, XSE: quasi-random mutations for evolution strategies, Proceedings of EA'05, 2005.

A. Auger and O. Teytaud, Continuous Lunches Are Free Plus the Design of??Optimal Optimization Algorithms, Algorithmica, vol.1, issue.1, pp.121-146, 2010.
DOI : 10.1007/s00453-008-9244-5
URL : https://hal.archives-ouvertes.fr/inria-00369788

H. Beyer and B. Sendhoff, Covariance Matrix Adaptation Revisited?The CMSA Evolution Strategy?. Parallel Problem Solving from Nature?PPSN X, pp.123-132, 2008.

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

K. Dejong, The Analysis of the Behavior of a Class of Genetic Adaptive Systems, 5140B. (University Microfilms No, pp.76-9381, 1975.

A. Georgieva and I. Jordanov, A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points. Computers and Operations Research, special issue on hybrid metaheuristics

D. E. Goldberg and J. Richardson, Genetic algorithms with sharing for multimodalfunction optimization, pp.41-49

N. Hansen and S. Kern, Evaluating the CMA Evolution Strategy on Multimodal Test Functions, Parallel Problem Solving from Nature-PPSN VIII, pp.282-291, 2004.
DOI : 10.1007/978-3-540-30217-9_29

G. Harik, Finding multiple solutions in problems of bounded difficulty, 1994.

G. Harik, Finding multimodal solutions using restricted tournament selection, Proc. Sixth International Conference on Genetic Algorithms, pp.24-31, 1995.

D. R. Jones, M. Schonlau, and W. J. Welch, Efficient global optimization of expensive black-box functions, Journal of Global Optimization, vol.13, issue.4, pp.455-492, 1998.
DOI : 10.1023/A:1008306431147

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, pp.419-474, 2002.

J. Li, M. Balazs, G. Parks, and P. Clarkson, A Species Conserving Genetic Algorithm for Multimodal Function Optimization, Evolutionary Computation, vol.1, issue.1, pp.207-234, 2002.
DOI : 10.1023/A:1008202821328

J. Li, M. E. Balazs, G. T. Parks, and P. J. Clarkson, A Species Conserving Genetic Algorithm for Multimodal Function Optimization, Evolutionary Computation, vol.1, issue.1, pp.207-234, 2002.
DOI : 10.1023/A:1008202821328

S. R. Lindemann and S. M. Lavalle, Incremental low-discrepancy lattice methods for motion planning, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422), pp.2920-2927, 2003.
DOI : 10.1109/ROBOT.2003.1242039

S. W. Mahfoud, Niching methods for genetic algorithms, 1995.

O. J. Mengshoel, D. E. Goldberg, W. Banzhaf, J. Daida, A. E. Eiben et al., Probabilistic crowding: Deterministic crowding with probabilisitic replacement, Proceedings of the Genetic and Evolutionary Computation Conference, pp.409-416, 1999.

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

A. B. Owen, Quasi-Monte Carlo sampling, Monte Carlo Ray Tracing: Siggraph 2003 Course 44, pp.69-88, 2003.

A. Pétrowski, A clearing procedure as a niching method for genetic algorithms, Proceedings of IEEE International Conference on Evolutionary Computation ICEC-96, pp.798-803, 1996.
DOI : 10.1109/ICEC.1996.542703

G. Singh and D. Deb, Comparison of multi-modal optimization algorithms based on evolutionary algorithms, Proceedings of the 8th annual conference on Genetic and evolutionary computation , GECCO '06, pp.1305-1312, 2006.
DOI : 10.1145/1143997.1144200

F. Teytaud and O. Teytaud, Log(lambda) Modifications for Optimal Parallelism, Parallel Problem Solving From Nature?PPSN XI, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00495087

O. Teytaud, When does quasi-random work? Parallel Problem Solving from, Nature?PPSN X, pp.325-336, 2008.
DOI : 10.1007/978-3-540-87700-4_33
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.4882

O. Teytaud and S. Gelly, DCMA, Proceedings of the 9th annual conference on Genetic and evolutionary computation , GECCO '07, pp.955-963, 2007.
DOI : 10.1145/1276958.1277150
URL : https://hal.archives-ouvertes.fr/inria-00173207

B. Vandewoestyne and R. Cools, Good permutations for deterministic scrambled halton sequences in terms of l2-discrepancy, Computational and Applied Mathematics, vol.189, issue.12, p.341361, 2006.

J. Villemonteix, E. Vazquez, and E. Walter, An informational approach to the global optimization of expensive-to-evaluate functions, Journal of Global Optimization, vol.10, issue.5, pp.509-534, 2009.
DOI : 10.1007/s10898-008-9354-2
URL : https://hal.archives-ouvertes.fr/hal-00354262

X. Yin and N. Germay, A Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization
DOI : 10.1007/978-3-7091-7533-0_65