{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:05Z","timestamp":1750220765081,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Russian Science Foundation","award":["17-71-20178"],"award-info":[{"award-number":["17-71-20178"]}]},{"DOI":"10.13039\/501100005304","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH, LabEx LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH, LabEx LMH"]}],"id":[{"id":"10.13039\/501100005304","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,25]]},"DOI":"10.1145\/3377930.3390148","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:29:12Z","timestamp":1593458952000},"page":"1259-1267","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["The (1 + (\n            <i>\u03bb,\u03bb<\/i>\n            )) GA is even faster on multimodal problems"],"prefix":"10.1145","author":[{"given":"Denis","family":"Antipov","sequence":"first","affiliation":[{"name":"ITMO University, St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitalii","family":"Karavaev","sequence":"additional","affiliation":[{"name":"ITMO University, St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/3377930.3390172"},{"doi-asserted-by":"crossref","unstructured":"Denis Antipov and Benjamin Doerr. 2020. Runtime Analysis of the Heavy-Tailed (1 + (\u03bb \u03bb)) Genetic Algorithm on Jump Functions. (2020). Unpublished.  Denis Antipov and Benjamin Doerr. 2020. Runtime Analysis of the Heavy-Tailed (1 + ( \u03bb \u03bb )) Genetic Algorithm on Jump Functions. (2020). Unpublished.","key":"e_1_3_2_1_2_1","DOI":"10.1007\/978-3-030-58115-2_38"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/3205455.3205627"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/3299904.3340317"},{"key":"e_1_3_2_1_5_1","volume-title":"The (1 + (\u03bb, \u03bb)) GA Is Even Faster on Multimodal Problems. CoRR abs\/2004.06702","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov , Benjamin Doerr , and Vitalii Karavaev . 2020. The (1 + (\u03bb, \u03bb)) GA Is Even Faster on Multimodal Problems. CoRR abs\/2004.06702 ( 2020 ). Denis Antipov, Benjamin Doerr, and Vitalii Karavaev. 2020. The (1 + (\u03bb, \u03bb)) GA Is Even Faster on Multimodal Problems. CoRR abs\/2004.06702 (2020)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/3071178.3071297"},{"key":"e_1_3_2_1_7_1","volume-title":"The unrestricted black-box complexity of jump functions. Evolutionary Computation","author":"Buzdalov Maxim","year":"2016","unstructured":"Maxim Buzdalov , Benjamin Doerr , and Mikhail Kever . 2016. The unrestricted black-box complexity of jump functions. Evolutionary Computation ( 2016 ), 719--744. Maxim Buzdalov, Benjamin Doerr, and Mikhail Kever. 2016. The unrestricted black-box complexity of jump functions. Evolutionary Computation (2016), 719--744."},{"key":"e_1_3_2_1_8_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Dang Duc-Cuong","year":"2016","unstructured":"Duc-Cuong Dang , Tobias Friedrich , Timo K\u00f6tzing , Martin S. Krejca , Per Kristian Lehre , Pietro Simone Oliveto , Dirk Sudholt , and Andrew M. Sutton . 2016. Escaping local optima with diversity mechanisms and crossover . In Genetic and Evolutionary Computation Conference, GECCO 2016 . ACM, 645--652. Duc-Cuong Dang, Tobias Friedrich, Timo K\u00f6tzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, and Andrew M. Sutton. 2016. Escaping local optima with diversity mechanisms and crossover. In Genetic and Evolutionary Computation Conference, GECCO 2016. ACM, 645--652."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/TEVC.2017.2724201"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1016\/j.spl.2018.03.016"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/3321707.3321747"},{"volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"Doerr Benjamin","unstructured":"Benjamin Doerr . 2020. Probabilistic tools for the analysis of randomized optimization heuristics . In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization . Springer , 1--87. Benjamin Doerr. 2020. Probabilistic tools for the analysis of randomized optimization heuristics. In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization. Springer, 1--87.","key":"e_1_3_2_1_12_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/s00453-017-0354-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/2463372.2463480"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1016\/j.tcs.2014.11.028"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/3071178.3071301"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/s00453-016-0190-3"},{"volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"Doerr Carola","unstructured":"Carola Doerr . 2020. Complexity theory for discrete black-box optimization heuristics . In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization . Springer , 133--211. Carola Doerr. 2020. Complexity theory for discrete black-box optimization heuristics. In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization. Springer, 133--211.","key":"e_1_3_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1016\/S0304-3975(01)00182-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/s00224-004-1177-z"},{"key":"e_1_3_2_1_21_1","volume-title":"On two problems of information theory. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei 8","author":"Erd\u0151s Paul","year":"1963","unstructured":"Paul Erd\u0151s and Alfr\u00e9d R\u00e9nyi . 1963. On two problems of information theory. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei 8 ( 1963 ), 229--243. Paul Erd\u0151s and Alfr\u00e9d R\u00e9nyi. 1963. On two problems of information theory. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei 8 (1963), 229--243."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/2908812.2908884"},{"key":"e_1_3_2_1_23_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Brian","year":"2014","unstructured":"Brian W. Goldman and William F. Punch. 2014. Parameter-less population pyramid . In Genetic and Evolutionary Computation Conference, GECCO 2014 . ACM, 785--792. Brian W. Goldman and William F. Punch. 2014. Parameter-less population pyramid. In Genetic and Evolutionary Computation Conference, GECCO 2014. ACM, 785--792."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/3205455.3205608"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1162\/106365605774666921"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/s00453-002-0940-2"},{"key":"e_1_3_2_1_27_1","volume-title":"Black-box search by unbiased variation. Algorithmica","author":"Lehre Per Kristian","year":"2012","unstructured":"Per Kristian Lehre and Carsten Witt . 2012. Black-box search by unbiased variation. Algorithmica ( 2012 ), 623--642. Per Kristian Lehre and Carsten Witt. 2012. Black-box search by unbiased variation. Algorithmica (2012), 623--642."},{"key":"e_1_3_2_1_28_1","volume-title":"PPSN","author":"M\u00fchlenbein Heinz","year":"1992","unstructured":"Heinz M\u00fchlenbein . 1992 . How genetic algorithms really work: Mutation and hillclimbing. In Parallel Problem Solving from Nature , PPSN 1992. Elsevier, 15--26. Heinz M\u00fchlenbein. 1992. How genetic algorithms really work: Mutation and hillclimbing. In Parallel Problem Solving from Nature, PPSN 1992. Elsevier, 15--26."},{"key":"e_1_3_2_1_29_1","volume-title":"Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. CoRR abs\/2004.03266","author":"Rajabi Amirhossein","year":"2020","unstructured":"Amirhossein Rajabi and Carsten Witt . 2020. Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. CoRR abs\/2004.03266 ( 2020 ). Amirhossein Rajabi and Carsten Witt. 2020. Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. CoRR abs\/2004.03266 (2020)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_31_1","volume-title":"PPSN","author":"Andrew","year":"2014","unstructured":"Andrew M. Sutton and Frank Neumann. 2014. Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulas. In Parallel Problem Solving from Nature , PPSN 2014 . Springer, 942--951. Andrew M. Sutton and Frank Neumann. 2014. Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulas. In Parallel Problem Solving from Nature, PPSN 2014. Springer, 942--951."},{"key":"e_1_3_2_1_32_1","volume-title":"PPSN","author":"Whitley Darrell","year":"2018","unstructured":"Darrell Whitley , Swetha Varadarajan , Rachel Hirsch , and Anirban Mukhopadhyay . 2018 . Exploration and exploitation without mutation: solving the jump function in &Theta;(n) time. In Parallel Problem Solving from Nature , PPSN 2018. Springer, 55--66. Darrell Whitley, Swetha Varadarajan, Rachel Hirsch, and Anirban Mukhopadhyay. 2018. Exploration and exploitation without mutation: solving the jump function in &Theta;(n) time. In Parallel Problem Solving from Nature, PPSN 2018. Springer, 55--66."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1162\/106365606776022751"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '20","name":"GECCO '20: Genetic and Evolutionary Computation Conference","location":"Canc\u00fan Mexico"},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390148","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377930.3390148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:07Z","timestamp":1750200067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,25]]},"references-count":33,"alternative-id":["10.1145\/3377930.3390148","10.1145\/3377930"],"URL":"https:\/\/doi.org\/10.1145\/3377930.3390148","relation":{},"subject":[],"published":{"date-parts":[[2020,6,25]]},"assertion":[{"value":"2020-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}