{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:55:21Z","timestamp":1783749321047,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DE160100850"],"award-info":[{"award-number":["DE160100850"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hasso Plattner Institute"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,2]]},"DOI":"10.1145\/3205455.3205515","type":"proceedings-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T12:30:37Z","timestamp":1530621037000},"page":"293-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Escaping large deceptive basins of attraction with heavy-tailed mutation operators"],"prefix":"10.1145","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Quinzan","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Wagner","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Carlos Ans\u00f3tegui Meinolf Sellmann and Kevin Tierney. 2009. A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. 142--157.","DOI":"10.5555\/1788994.1789011"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of GECCO. 11--18","author":"Birattari Mauro","year":"2002","unstructured":"Mauro Birattari, Thomas St\u00fctzle, Luis Paquete, and Klaus Varrentrapp. 2002. A Racing Algorithm for Configuring Metaheuristics. In Proc. of GECCO. 11--18."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885031.1885033"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00055"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771166"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"A. E. Eiben and J. E. Smith. 2003. Introduction to evolutionary computation. Springer.","DOI":"10.5555\/954563"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/090779346"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00159"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.4.17401"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754738"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of GECCO. 626--633","author":"Hoyweghen Clarissa Van","year":"2002","unstructured":"Clarissa Van Hoyweghen, David E. Goldberg, and Bart Naudts. 2002. From Twomax To The Ising Model: Easy And Hard Symmetrical Problems. In Proc. of GECCO. 626--633."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1099040.1704883"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. of PPSN. 15--26","author":"M\u00fchlenbein Heinz","year":"1992","unstructured":"Heinz M\u00fchlenbein. 1992. How Genetic Algorithms Really Work: Mutation and Hillclimbing. In Proc. of PPSN. 15--26."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645825.668946"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684097"}],"event":{"name":"GECCO '18: Genetic and Evolutionary Computation Conference","location":"Kyoto Japan","acronym":"GECCO '18","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\/3205455.3205515","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205455.3205515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:56Z","timestamp":1750208936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":20,"alternative-id":["10.1145\/3205455.3205515","10.1145\/3205455"],"URL":"https:\/\/doi.org\/10.1145\/3205455.3205515","relation":{},"subject":[],"published":{"date-parts":[[2018,7,2]]},"assertion":[{"value":"2018-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}