{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:34:40Z","timestamp":1759178080626,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"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\/100009743","name":"Swenson College of Science and Engineering, University of Minnesota Duluth","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009743","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.3205525","type":"proceedings-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T12:30:37Z","timestamp":1530621037000},"page":"301-308","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences"],"prefix":"10.1145","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Quinzan","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew M.","family":"Sutton","sequence":"additional","affiliation":[{"name":"University of Minnesota Duluth"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754760"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1231"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10645"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.4.17401"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645824.668575"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2051237.2051250"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2004.841903"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. KI-94 Workshop Genetic Algorithms Within Framework Evol. Comput. 86--90","author":"Khuri Sami","year":"1994","unstructured":"Sami Khuri and Thomas B\u00e4ck. 1994. An Evolutionary Heuristic for the Minimum Vertex Cover Problem. In Proc. KI-94 Workshop Genetic Algorithms Within Framework Evol. Comput. 86--90."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001711"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2999134.2999195"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071329"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Helena Ramalhinho Louren\u00e7o Oliver C. Martin and Thomas St\u00fctzle. 2003. Iterated Local Search. 320--353.","DOI":"10.1007\/0-306-48056-5_11"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90029-9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2955239.2955249"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015376"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. of PPSN-II. 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-II. 15--26."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014362"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"}],"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"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205525","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205455.3205525","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.3205525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":19,"alternative-id":["10.1145\/3205455.3205525","10.1145\/3205455"],"URL":"https:\/\/doi.org\/10.1145\/3205455.3205525","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"}}]}}