{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:11:09Z","timestamp":1767989469818,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Government of Russian Federation","award":["Grant 08-08"],"award-info":[{"award-number":["Grant 08-08"]}]},{"name":"Paris Ile de France Region","award":["Online Configuration of Heuristic Optimization Algorithms"],"award-info":[{"award-number":["Online Configuration of Heuristic Optimization Algorithms"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321838","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"1461-1469","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["The efficiency threshold for the offspring population size of the (\n            <i>\u00b5, \u03bb<\/i>\n            ) EA"],"prefix":"10.1145","author":[{"given":"Denis","family":"Antipov","sequence":"first","affiliation":[{"name":"ITMO University, St. Petersburg, Russia and \u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quentin","family":"Yang","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205627"},{"key":"e_1_3_2_1_2_1","volume-title":"The efficiency threshold for the offspring population size of the (\u00b5, \u03bb) EA. arXiv e-prints arXiv:1904.06981","author":"Antipov Denis","year":"2019","unstructured":"Denis Antipov , Benjamin Doerr , and Quentin Yang . 2019. The efficiency threshold for the offspring population size of the (\u00b5, \u03bb) EA. arXiv e-prints arXiv:1904.06981 ( 2019 ). Denis Antipov, Benjamin Doerr, and Quentin Yang. 2019. The efficiency threshold for the offspring population size of the (\u00b5, \u03bb) EA. arXiv e-prints arXiv:1904.06981 (2019)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.   Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2753538"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0103-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700021480"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77449-7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321819"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426671"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCI.2007.372143"},{"key":"e_1_3_2_1_12_1","volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","unstructured":"Thomas Jansen . 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective . Springer . Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer."},{"key":"e_1_3_2_1_13_1","volume-title":"PPSN","author":"Lehre Per Kristian","year":"2010","unstructured":"Per Kristian Lehre . 2010 . Negative drift in populations. In Parallel Problem Solving from Nature , PPSN 2010. Springer, 244--253. Per Kristian Lehre. 2010. Negative drift in populations. In Parallel Problem Solving from Nature, PPSN 2010. Springer, 244--253."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001855"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570016"},{"key":"e_1_3_2_1_16_1","volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann Frank","unstructured":"Frank Neumann and Carsten Witt . 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity . Springer . Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer."},{"key":"e_1_3_2_1_17_1","volume-title":"Advances in Artificial Life","author":"Ochoa Gabriela","unstructured":"Gabriela Ochoa , Inman Harvey , and Hilary Buxton . 1999. Error thresholds and their relation to optimal mutation rates . In Advances in Artificial Life . Springer Berlin Heidelberg , 54--63. Gabriela Ochoa, Inman Harvey, and Hilary Buxton. 1999. Error thresholds and their relation to optimal mutation rates. In Advances in Artificial Life. Springer Berlin Heidelberg, 54--63."},{"key":"e_1_3_2_1_18_1","volume-title":"Erratum: simplified drift analysis for proving lower bounds in evolutionary computation. arXiv e-prints arXiv:1211.7184","author":"Oliveto Pietro Simone","year":"2012","unstructured":"Pietro Simone Oliveto and Carsten Witt . 2012. Erratum: simplified drift analysis for proving lower bounds in evolutionary computation. arXiv e-prints arXiv:1211.7184 ( 2012 ). Pietro Simone Oliveto and Carsten Witt. 2012. Erratum: simplified drift analysis for proving lower bounds in evolutionary computation. arXiv e-prints arXiv:1211.7184 (2012)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.002"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321838","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:29Z","timestamp":1750206329000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":21,"alternative-id":["10.1145\/3321707.3321838","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321838","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}