{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:16:28Z","timestamp":1742922988911,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540389903"},{"type":"electronic","value":"9783540389910"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_6","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T18:55:37Z","timestamp":1160074537000},"page":"52-61","source":"Crossref","is-referenced-by-count":3,"title":["How Comma Selection Helps with the Escape from Local Optima"],"prefix":"10.1007","author":[{"given":"Jens","family":"J\u00e4gersk\u00fcpper","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Storch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1105-2","volume-title":"Noisy Optimization with Evolution Strategies","author":"D. Arnold","year":"2002","unstructured":"Arnold, D.: Noisy Optimization with Evolution Strategies. Springer, Heidelberg (2002)"},{"issue":"301","key":"6_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. American Statistical Association Journal\u00a058(301), 13\u201330 (1963)","journal-title":"American Statistical Association Journal"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1007\/3-540-45061-0_82","volume-title":"Automata, Languages and Programming","author":"J. J\u00e4gersk\u00fcpper","year":"2003","unstructured":"J\u00e4gersk\u00fcpper, J.: Analysis of a simple evolutionary algorithm for minimization in Euclidean spaces. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1068\u20131079. Springer, Heidelberg (2003)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/CEC.2005.1554686","volume-title":"Proc. 2005 IEEE Congress on Evolutionary Computation (CEC)","author":"J. J\u00e4gersk\u00fcpper","year":"2005","unstructured":"J\u00e4gersk\u00fcpper, J.: On the complexity of overcoming gaps with isotropic mutations and elitist selection. In: Proc. 2005 IEEE Congress on Evolutionary Computation (CEC), pp. 206\u2013213. IEEE Press, Los Alamitos (2005)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J.: Probabilistic runtime analysis of $(1\\overset{+}{,}\\lambda)$ ES using isotropic mutations. In: Genetic and Evolutionary Computation Conference (GECCO) (2006) (accepted)","DOI":"10.1145\/1143997.1144083"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1145\/1068009.1068153","volume-title":"Proc. 2005 Genetic and Evolutionary Computation Conference (GECCO)","author":"J. J\u00e4gersk\u00fcpper","year":"2005","unstructured":"J\u00e4gersk\u00fcpper, J., Witt, C.: Rigorous runtime analysis of a (\u03bc+1) ES for the sphere function. In: Proc. 2005 Genetic and Evolutionary Computation Conference (GECCO), pp. 849\u2013856. ACM Press, New York (2005)"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T. Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation\u00a013(4), 413\u2013440 (2005)","journal-title":"Evolutionary Computation"},{"key":"6_CR8","volume-title":"Evolution and Optimum Seeking","author":"H.-P. Schwefel","year":"1995","unstructured":"Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T01:05:12Z","timestamp":1664240712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11844297_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}