{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:24Z","timestamp":1725518424985},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876991"},{"type":"electronic","value":"9783540877004"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87700-4_11","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T11:50:04Z","timestamp":1221306604000},"page":"102-111","source":"Crossref","is-referenced-by-count":12,"title":["Lower Bounds for Evolution Strategies Using VC-Dimension"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Teytaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herv\u00e9","family":"Fournier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11513575_12","volume-title":"Foundations of Genetic Algorithms","author":"D.V. Arnold","year":"2005","unstructured":"Arnold, D.V.: Optimal weighted recombination. In: Wright, A.H., Vose, M.D., De Jong, K.A., Schmitt, L.M. (eds.) FOGA 2005. LNCS, vol.\u00a03469, pp. 215\u2013237. Springer, Heidelberg (2005)"},{"issue":"1-3","key":"11_CR2","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. Theoretical Computer Science\u00a0334(1-3), 35\u201369 (2005)","journal-title":"Theoretical Computer Science"},{"key":"11_CR3","first-page":"92","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"T. B\u00e4ck","year":"1991","unstructured":"B\u00e4ck, T., Hoffmeister, F., Schwefel, H.-P.: Extended selection mechanisms in genetic algorithms. In: Belew, R.K., Booker, L.B. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 92\u201399. Morgan Kaufmann Publishers, San Mateo (1991)"},{"key":"11_CR4","first-page":"14","volume-title":"Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application","author":"J.E. Baker","year":"1987","unstructured":"Baker, J.E.: Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, pp. 14\u201321. Lawrence Erlbaum Associates, Inc., Mahwah (1987)"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1162\/evco.1995.3.1.81","volume":"3","author":"H.-G. Beyer","year":"1995","unstructured":"Beyer, H.-G.: Toward a theory of evolution strategies: On the benefit of sex - the (\u03bc\/\u03bc,\u03bb)-theory. Evolutionary Computation\u00a03(1), 81\u2013111 (1995)","journal-title":"Evolutionary Computation"},{"issue":"1","key":"11_CR6","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: a comprehensive introduction. Natural Computing\u00a01(1), 3\u201352 (2002)","journal-title":"Natural Computing"},{"key":"11_CR7","volume-title":"A probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1997","unstructured":"Devroye, L., Gy\u00f6rfi, L., Lugosi, G.: A probabilistic Theory of Pattern Recognition. Springer, Heidelberg (1997)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Droste, S.: Not all linear functions are equally difficult for the compact genetic algorithm. In: Proc. of the Genetic and Evolutionary Computation COnference (GECCO 2005), pp. 679\u2013686 (2005)","DOI":"10.1145\/1068009.1068124"},{"key":"11_CR9","volume-title":"An introduction to Probability Theory and its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An introduction to Probability Theory and its Applications. Wiley, Chichester (1968)"},{"issue":"4","key":"11_CR10","first-page":"411","volume":"15","author":"S. Gelly","year":"2007","unstructured":"Gelly, S., Ruette, S., Teytaud, O.: Comparison-based algorithms are robust and randomized algorithms are anytime. Evolutionary Computation Journal (MIT Press), Special issue on bridging Theory and Practice\u00a015(4), 411\u2013434 (2007)","journal-title":"Evolutionary Computation Journal (MIT Press), Special issue on bridging Theory and Practice"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N. Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation\u00a09(2), 159\u2013195 (2001)","journal-title":"Evolutionary Computation"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/321062.321069","volume":"8","author":"R. Hooke","year":"1961","unstructured":"Hooke, R., Jeeves, T.A.: \u201dDirect search\u201d solution of numerical and statistical problems. Journal of the ACM\u00a08(2), 212\u2013229 (1961)","journal-title":"Journal of the ACM"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J., Witt, C.: Rigorous runtime analysis of a (\u03bc\u2009+\u20091)ES for the sphere function. In: GECCO, pp. 849\u2013856 (2005)","DOI":"10.1145\/1068009.1068153"},{"key":"11_CR14","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol.\u00a0212. Springer, Heidelberg (2002)"},{"key":"11_CR15","volume-title":"Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution","author":"I. Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart (1973)"},{"issue":"3","key":"11_CR16","first-page":"375","volume":"26","author":"G. Rudolph","year":"1997","unstructured":"Rudolph, G.: Convergence rates of evolutionary algorithms for a class of convex objective functions. Control and Cybernetics\u00a026(3), 375\u2013390 (1997)","journal-title":"Control and Cybernetics"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N. Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. Journal of Combinatorial Theory, Ser. A\u00a013(1), 145\u2013147 (1972)","journal-title":"Journal of Combinatorial Theory, Ser. A"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Teytaud, O., Gelly, S.: General lower bounds for evolutionary algorithms. In: Proceedings of PPSN, pp. 21\u201331 (2006)","DOI":"10.1007\/11844297_3"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"XVI","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Ya.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications\u00a0XVI(2), 264\u2013280 (1971)","journal-title":"Theory of Probability and its Applications"},{"key":"11_CR20","first-page":"116","volume-title":"Proceedings of the Third International Conference on Genetic Algorithms","author":"D. Whitley","year":"1989","unstructured":"Whitley, D.: The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, pp. 116\u2013121. Morgan Kaufmann, San Mateo (1989)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN X"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87700-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:44:30Z","timestamp":1558280670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87700-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876991","9783540877004"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87700-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}