{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:30:36Z","timestamp":1738387836507,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876991"},{"type":"electronic","value":"9783540877004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87700-4_3","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T11:50:04Z","timestamp":1221306604000},"page":"21-30","source":"Crossref","is-referenced-by-count":2,"title":["Convergence Analysis of Evolution Strategies with Random Numbers of Offspring"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Fran\u00e7ois","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2004.11.017","volume":"334","author":"A. Auger","year":"2005","unstructured":"Auger, A.: Convergence results for (1,\u03bb)-SA-ES using the theory of \u03d5-irreducible Markov chains. Theor. Comput. Sci.\u00a0334, 35\u201369 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR2","unstructured":"Bartz-Beielstein, T.: Experimental Research in Evolutionary Computation \u2013 The New Experimentalism. Natural Computing Series. Springer, Berlin"},{"key":"3_CR3","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04378-3","volume-title":"The Theory of Evolution Strategies","author":"H.-G. Beyer","year":"2001","unstructured":"Beyer, H.-G.: The Theory of Evolution Strategies. Natural Computing Series. Springer, Heidelberg (2001)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0304-3975(02)00137-8","volume":"287","author":"H.-G. Beyer","year":"2002","unstructured":"Beyer, H.-G., Schwefel, H.-P., Wegener, I.: How to analyse evolutionary algorithms. Theor. Comput. Sci.\u00a0287, 101\u2013130 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H.-G. Beyer","year":"2002","unstructured":"Beyer, H.-G., Schwefel, H.-P.: Evolution strategies \u2013 A comprehensive introduction. Natural Computing\u00a01, 3\u201352 (2002)","journal-title":"Natural Computing"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0304-3975(03)00284-6","volume":"306","author":"A. Bienven\u00fce","year":"2003","unstructured":"Bienven\u00fce, A., Fran\u00e7ois, O.: Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties. Theor. Comput. Sci.\u00a0306, 269\u2013289 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1021078914200","volume":"110","author":"A. Cercueil","year":"2003","unstructured":"Cercueil, A., Fran\u00e7ois, O.: Sharp asymptotics for fixation times in stochastic population genetics models at low mutation probabilities. Journal of Statistical Physics\u00a0110, 311\u2013332 (2003)","journal-title":"Journal of Statistical Physics"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1239\/aap\/1035228082","volume":"30","author":"R. Cerf","year":"1998","unstructured":"Cerf, R.: Asymptotic convergence of genetic algorithms. Adv. Appl. Probab.\u00a030, 521\u2013550 (1998)","journal-title":"Adv. Appl. Probab."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1 + 1) EA. Theor. Comput. Sci. (276), 51\u201381 (2002)","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/4235.735430","volume":"2","author":"O. Fran\u00e7ois","year":"1998","unstructured":"Fran\u00e7ois, O.: An evolutionary algorithm for global minimization and its Markov chain analysis. IEEE Trans. Evol. Comput.\u00a02, 77\u201390 (1998)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/4235.918434","volume":"5","author":"O. Fran\u00e7ois","year":"2001","unstructured":"Fran\u00e7ois, O., Lavergne, C.: Design of evolutionary algorithms: A statistical perspective. IEEE Trans. Evol. Comput.\u00a05, 129\u2013148 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1214\/aoap\/1015961163","volume":"12","author":"O. Fran\u00e7ois","year":"2002","unstructured":"Fran\u00e7ois, O.: Global optimization with exploration\/selection algorithms and simulated annealing. Ann. Appl. Probab.\u00a012, 248\u2013271 (2002)","journal-title":"Ann. Appl. Probab."},{"key":"3_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-0176-9","volume-title":"Random Perturbations of Dynamical Systems","author":"M.I. Freidlin","year":"1984","unstructured":"Freidlin, M.I., Wentzell, A.D.: Random Perturbations of Dynamical Systems. Springer, New York (1984)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"Hajek, B.: Cooling schedules for optimal annealing. Math. Oper. Research\u00a013, 311\u2013329 (1988)","journal-title":"Math. Oper. Research"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.tcs.2007.02.042","volume":"379","author":"J. J\u00e4gersk\u00fcpper","year":"2007","unstructured":"J\u00e4gersk\u00fcpper, J.: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theor. Comput. Sci.\u00a0379, 329\u2013347 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M. Mitchell","year":"1996","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-540-24854-5_73","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"F. Neumann","year":"2004","unstructured":"Neumann, F., Wegener, I., Randomized, I.: local search, evolutionary algorithms, and the minimum spanning tree problem. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol.\u00a03102, pp. 713\u2013724. Springer, Heidelberg (2004)"},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.3233\/FI-1998-35123405","volume":"35","author":"G. Rudolph","year":"1998","unstructured":"Rudolph, G.: Finite Markov chain results in evolutionary computation: A tour d\u2019horizon. Fundam. Inform.\u00a035, 67\u201389 (1998)","journal-title":"Fundam. Inform."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00406-0","volume":"259","author":"L.M. Schmitt","year":"2001","unstructured":"Schmitt, L.M.: Theory of genetic algorithms. Theor. Comput. Sci.\u00a0259, 1\u201361 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S0963548304006650","volume":"14","author":"I. Wegener","year":"2005","unstructured":"Wegener, I., Witt, C.: On the optimization of monotone polynomials by simple randomized search heuristics. Combin. Probab. Comput.\u00a014, 225\u2013247 (2005)","journal-title":"Combin. Probab. Comput."},{"key":"3_CR21","first-page":"65","volume":"14","author":"C. Witt","year":"2006","unstructured":"Witt, C.: Runtime Analysis of the (\u03bc\u2009+\u20091) EA on Simple Pseudo-Boolean Functions. Evol. Comput.\u00a014, 65\u201386 (2006)","journal-title":"Evol. Comput."},{"key":"3_CR22","unstructured":"Wright, S.: The roles of mutation, inbreeding, crossbreeding and selection in evolution. In: Proceedings of the VI International Congress of Genetics, pp. 356\u2013366 (1932)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN X"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87700-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:54:35Z","timestamp":1738364075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87700-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876991","9783540877004"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87700-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}