{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:59Z","timestamp":1750221239778,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":97,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T00:00:00Z","timestamp":1530835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,6]]},"DOI":"10.1145\/3205651.3207889","type":"proceedings-article","created":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T19:30:44Z","timestamp":1530905444000},"page":"389-414","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Theory for non-theoreticians"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"World Scientific","author":"Auger Anne","year":"2011","unstructured":"{AD11} Anne Auger and Benjamin Doerr . Theory of Randomized Search Heuristics . World Scientific , 2011 . {AD11} Anne Auger and Benjamin Doerr. Theory of Randomized Search Heuristics. World Scientific, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205627"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900602"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645513.657408"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527134"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071297"},{"key":"e_1_3_2_1_7_1","first-page":"1","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN)","author":"B\u00f6ttcher S\u00fcntje","year":"2010","unstructured":"{BDN10} S\u00fcntje B\u00f6ttcher , Benjamin Doerr , and Frank Neumann . Optimal fixed and adaptive mutation rates for the LeadingOnes problem . In Proc. of Parallel Problem Solving from Nature (PPSN) , pages 1 -- 10 . Springer , 2010 . {BDN10} S\u00fcntje B\u00f6ttcher, Benjamin Doerr, and Frank Neumann. Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In Proc. of Parallel Problem Solving from Nature (PPSN), pages 1--10. Springer, 2010."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754684"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754683"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598341"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.07.009"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987372"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908950"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071279"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424704"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389202"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_99"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277192"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830618"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967669"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.059"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00055"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1998.6.2.185"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830748"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.015"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCI.2007.372176"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754654"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205611"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205563"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908885"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754760"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1006209"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460245"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569937"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.10.004"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330345"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9684-9"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205569"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771166"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.1.3"},{"key":"e_1_3_2_1_46_1","first-page":"109","volume-title":"Proc. of Foundations of Genetic Algorithms (FOGA)","author":"Forrest Stephanie","year":"1992","unstructured":"{FM92} Stephanie Forrest and Melanie Mitchell . Relative building-block fitness and the building block hypothesis . In Proc. of Foundations of Genetic Algorithms (FOGA) , pages 109 -- 126 . Morgan Kaufmann , 1992 . {FM92} Stephanie Forrest and Melanie Mitchell. Relative building-block fitness and the building block hypothesis. In Proc. of Foundations of Genetic Algorithms (FOGA), pages 109--126. Morgan Kaufmann, 1992."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_109"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.2.173"},{"key":"e_1_3_2_1_49_1","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg David E.","year":"1989","unstructured":"{Gol89} David E. Goldberg . Genetic Algorithms in Search, Optimization and Machine Learning . Addison-Wesley Longman Publishing Co., Inc. , 1989 . {Gol89} David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., 1989."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598350"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754738"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_7"},{"key":"e_1_3_2_1_53_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-58484-6_259","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN)","author":"Horn Jeff","year":"1994","unstructured":"{HGD94} Jeff Horn , David Goldberg , and Kalyan Deb . Long path problems . In Proc. of Parallel Problem Solving from Nature (PPSN) , volume 866 of Lecture Notes in Computer Science , pages 149 -- 158 . Springer , 1994 . {HGD94} Jeff Horn, David Goldberg, and Kalyan Deb. Long path problems. In Proc. of Parallel Problem Solving from Nature (PPSN), volume 866 of Lecture Notes in Computer Science, pages 149--158. Springer, 1994."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389277"},{"key":"e_1_3_2_1_55_1","volume-title":"Adaptation in Natural and Artificial Systems","author":"Holland John H.","year":"1975","unstructured":"{Hol75} John H. Holland . Adaptation in Natural and Artificial Systems . University of Michigan Press , 1975 . {Hol75} John H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"e_1_3_2_1_57_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-87700-4_5","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN)","author":"J\u00e4gersk\u00fcpper Jens","year":"2008","unstructured":"{J\u00e4g08} Jens J\u00e4gersk\u00fcpper . A blend of Markov-chain and drift analysis . In Proc. of Parallel Problem Solving from Nature (PPSN) , volume 5199 of Lecture Notes in Computer Science , pages 41 -- 51 . Springer , 2008 . {J\u00e4g08} Jens J\u00e4gersk\u00fcpper. A blend of Markov-chain and drift analysis. In Proc. of Parallel Problem Solving from Nature (PPSN), volume 5199 of Lecture Notes in Computer Science, pages 41--51. Springer, 2008."},{"key":"e_1_3_2_1_58_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/978-3-540-73482-6_4","volume-title":"Proc. of Foundations of Genetic Algorithms (FOGA)","author":"Jansen Thomas","year":"2007","unstructured":"{Jan07} Thomas Jansen . On the brittleness of evolutionary algorithms . In Christopher R. Stephens, Marc Toussaint, L. Darrell Whitley, and Peter F. Stadler, editors, Proc. of Foundations of Genetic Algorithms (FOGA) , volume 4436 of Lecture Notes in Computer Science , pages 54 -- 69 . Springer , 2007 . {Jan07} Thomas Jansen. On the brittleness of evolutionary algorithms. In Christopher R. Stephens, Marc Toussaint, L. Darrell Whitley, and Peter F. Stadler, editors, Proc. of Foundations of Genetic Algorithms (FOGA), volume 4436 of Lecture Notes in Computer Science, pages 54--69. Springer, 2007."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms---The Computer Science Perspective","author":"Jansen Thomas","year":"2013","unstructured":"{Jan13} Thomas Jansen . Analyzing Evolutionary Algorithms---The Computer Science Perspective . Springer , 2013 . {Jan13} Thomas Jansen. Analyzing Evolutionary Algorithms---The Computer Science Perspective. Springer, 2013."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460248"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068152"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/647909.740300"},{"key":"e_1_3_2_1_64_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-45356-3_9","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN)","author":"Jansen Thomas","year":"2000","unstructured":"{JW00} Thomas Jansen and Ingo Wegener . On the choice of the mutation probability for the (1+1) EA . In Proc. of Parallel Problem Solving from Nature (PPSN) , volume 1917 of Lecture Notes in Computer Science , pages 89 -- 98 . Springer , 2000 . {JW00} Thomas Jansen and Ingo Wegener. On the choice of the mutation probability for the (1+1) EA. In Proc. of Parallel Problem Solving from Nature (PPSN), volume 1917 of Lecture Notes in Computer Science, pages 89--98. Springer, 2000."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.5555\/1099040.1704883"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.01.002"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2308294"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32937-1_12"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071288"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967671"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598301"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.06.035"},{"key":"e_1_3_2_1_74_1","first-page":"15","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN)","author":"M\u00fchlenbein Heinz","year":"1992","unstructured":"{M\u00fch92} Heinz M\u00fchlenbein . How genetic algorithms really work: Mutation and hillclimbing . In Proc. of Parallel Problem Solving from Nature (PPSN) , pages 15 -- 26 . Elsevier , 1992 . {M\u00fch92} Heinz M\u00fchlenbein. How genetic algorithms really work: Mutation and hillclimbing. In Proc. of Parallel Problem Solving from Nature (PPSN), pages 15--26. Elsevier, 1992."},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1330957"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570016"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_78_1","volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann Frank","year":"2010","unstructured":"{NW10} Frank Neumann and Carsten Witt . Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity . Springer , 2010 . {NW10} Frank Neumann and Carsten Witt. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer, 2010."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014362"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.002"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.10.028"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/1570256.1570322"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830761.1830791"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754758"},{"key":"e_1_3_2_1_85_1","volume-title":"Kovac","author":"Rudolph G\u00fcnter","year":"1997","unstructured":"{Rud97} G\u00fcnter Rudolph . Convergence Properties of Evolutionary Algorithms . Kovac , 1997 . {Rud97} G\u00fcnter Rudolph. Convergence Properties of Evolutionary Algorithms. Kovac, 1997."},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001692"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1016\/0375-9601(87)90796-1"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144099"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068202"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.047"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598237"},{"key":"e_1_3_2_1_96_1","series-title":"Lecture Notes in Computer Science","first-page":"151","volume-title":"Evolutionary Programming","author":"Yao Xin","year":"1997","unstructured":"{YL97} Xin Yao and Yong Liu . Fast evolution strategies . In Evolutionary Programming , volume 1213 of Lecture Notes in Computer Science , pages 151 -- 162 . Springer , 1997 . {YL97} Xin Yao and Yong Liu. Fast evolution strategies. In Evolutionary Programming, volume 1213 of Lecture Notes in Computer Science, pages 151--162. Springer, 1997."},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771163"}],"event":{"name":"GECCO '18: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Kyoto Japan","acronym":"GECCO '18"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205651.3207889","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205651.3207889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:24Z","timestamp":1750212444000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205651.3207889"}},"subtitle":["tutorial"],"short-title":[],"issued":{"date-parts":[[2018,7,6]]},"references-count":97,"alternative-id":["10.1145\/3205651.3207889","10.1145\/3205651"],"URL":"https:\/\/doi.org\/10.1145\/3205651.3207889","relation":{},"subject":[],"published":{"date-parts":[[2018,7,6]]},"assertion":[{"value":"2018-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}