{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:08Z","timestamp":1750306088723,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,15]],"date-time":"2017-07-15T00:00:00Z","timestamp":1500076800000},"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":[[2017,7,15]]},"DOI":"10.1145\/3067695.3067713","type":"proceedings-article","created":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T20:17:18Z","timestamp":1499804238000},"page":"389-412","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":"Ecole Polytechnique Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,15]]},"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\/1527125.1527134"},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN)","author":"B\u00f6ttcher S.","year":"2010","unstructured":"{BDN10} S. B\u00f6ttcher , B. Doerr , and F. 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. B\u00f6ttcher, B. Doerr, and F. 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_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754684"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754683"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908950"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424704"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389202"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_99"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277192"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830618"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967669"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.059"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00055"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1998.6.2.185"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.015"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCI.2007.372176"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754654"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908885"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754760"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1006209"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1761233.1761353"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460245"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569937"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771166"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.1.3"},{"key":"e_1_3_2_1_29_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_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_109"},{"key":"e_1_3_2_1_31_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_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598350"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754738"},{"key":"e_1_3_2_1_34_1","first-page":"149","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN), LNCS 866","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), LNCS 866 , 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), LNCS 866, pages 149--158. Springer, 1994."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389277"},{"key":"e_1_3_2_1_36_1","volume-title":"Adaptation in Natural and Artificial Systems","author":"Holland J.H.","year":"1975","unstructured":"{Hol75} J.H. Holland . Adaptation in Natural and Artificial Systems . University of Michigan Press , 1975 . {Hol75} J.H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975."},{"key":"e_1_3_2_1_37_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_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460248"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068152"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/647909.740300"},{"key":"e_1_3_2_1_41_1","volume-title":"Real royal road functions-where crossover provably is essential. Discrete Applied Mathematics, 149(1--3):111--125","author":"Jansen Thomas","year":"2005","unstructured":"{JW05} Thomas Jansen and Ingo Wegener . Real royal road functions-where crossover provably is essential. Discrete Applied Mathematics, 149(1--3):111--125 , 2005 . {JW05} Thomas Jansen and Ingo Wegener. Real royal road functions-where crossover provably is essential. Discrete Applied Mathematics, 149(1--3):111--125, 2005."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.01.002"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2308294"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32937-1_12"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967671"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598301"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.06.035"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1330957"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570016"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_52_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_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014362"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.002"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.10.028"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754758"},{"key":"e_1_3_2_1_57_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_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144099"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068202"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.047"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598237"}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Berlin Germany","acronym":"GECCO '17"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3067695.3067713","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3067695.3067713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:19Z","timestamp":1750217419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3067695.3067713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,15]]},"references-count":64,"alternative-id":["10.1145\/3067695.3067713","10.1145\/3067695"],"URL":"https:\/\/doi.org\/10.1145\/3067695.3067713","relation":{},"subject":[],"published":{"date-parts":[[2017,7,15]]},"assertion":[{"value":"2017-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}