, Optimal Weighted Recombination, Foundations of Genetic Algorithms, pp.215-237, 2005.
DOI : 10.1007/11513575_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.610
, Convergence results for the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>??</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-SA-ES using the theory of <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-irreducible Markov chains, Theoretical Computer Science, vol.334, issue.1-3, pp.35-69, 2005.
DOI : 10.1016/j.tcs.2004.11.017
, Extended selection mechanisms in genetic algorithms, Proceedings of the Fourth International Conference on Genetic Algorithms, 1991.
, Reducing bias and inefficiency in the selection algorithm, Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, pp.14-21, 1987.
, Toward a Theory of Evolution Strategies: On the Benefits of Sex??? the (??/??, ??) Theory, Evolutionary Computation, vol.3, issue.1, pp.81-111, 1995.
DOI : 10.1162/evco.1993.1.2.165
, Evolution strategies, Scholarpedia, vol.2, issue.8, pp.3-52, 2002.
DOI : 10.4249/scholarpedia.1965
, A probabilistic Theory of Pattern Recognition, 1997.
DOI : 10.1007/978-1-4612-0711-5
, Not all linear functions are equally difficult for the compact genetic algorithm, Proceedings of the 2005 conference on Genetic and evolutionary computation , GECCO '05, pp.679-686, 2005.
DOI : 10.1145/1068009.1068124
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.7139
, An introduction to Probability Theory and its Applications, 1968.
, Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime, Special issue on bridging Theory and Practice, p.26, 2007.
DOI : 10.1137/0801010
URL : https://hal.archives-ouvertes.fr/inria-00173221
, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, vol.9, issue.2, 2003.
DOI : 10.1016/0004-3702(95)00124-7
, `` Direct Search'' Solution of Numerical and Statistical Problems, Journal of the ACM, vol.8, issue.2, pp.212-229, 1961.
DOI : 10.1145/321062.321069
, Lectures on Discrete Geometry, Graduate Texts in Mathematics, vol.212, 2002.
DOI : 10.1007/978-1-4613-0039-7
, Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution, 1973.
, On the number of zero-patterns of a sequence of polynomials, Journal of the American Mathematical Society, vol.14, issue.03, pp.717-735, 2001.
DOI : 10.1090/S0894-0347-01-00367-8
, Convergence rates of evolutionary algorithms for a class of convex objective functions, Control and Cybernetics, vol.26, issue.3, pp.375-390, 1997.
, On the density of families of sets, Journal of Combinatorial Theory, Series A, vol.13, issue.1, pp.145-147, 1972.
DOI : 10.1016/0097-3165(72)90019-2
, General Lower Bounds for Evolutionary Algorithms, proceedings of PPSN, pp.21-31, 2006.
DOI : 10.1007/11844297_3
URL : https://hal.archives-ouvertes.fr/inria-00112820
, On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, pp.264-280, 1971.
, The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best, Proceedings of the Third International Conference on Genetic Algorithms, 1989.