{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T23:31:34Z","timestamp":1790033494224,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T00:00:00Z","timestamp":1436572800000},"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":[[2015,7,11]]},"DOI":"10.1145\/2739480.2754760","type":"proceedings-article","created":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T19:38:55Z","timestamp":1436297935000},"page":"815-822","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Money for Nothing"],"prefix":"10.1145","author":[{"given":"Axel","family":"de Perthuis de Laillevault","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Universit\u00e9 Paris-Saclay, Paris-Saclay, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Universit\u00e9 Paris-Saclay, Paris-Saclay, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"CNRS and Universite Pierre et Marie Curie (Paris 6), Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"World Scientific","author":"Auger A.","year":"2011","unstructured":"A. Auger and B. Doerr . Theory of Randomized Search Heuristics . World Scientific , 2011 . A. Auger and B. Doerr. Theory of Randomized Search Heuristics. World Scientific, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1941-0003498-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.03.008"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885031.1885033"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598338"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789814282673_0001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598359"},{"key":"e_1_3_2_1_8_1","volume-title":"A28: 1--19","author":"Esseen C.-G.","year":"1942","unstructured":"C.-G. Esseen . On the liapunoff limit of error in the theory of probability. Arkiv f\u00f6r matematik, astronomioch fysik , A28: 1--19 , 1942 . C.-G. Esseen. On the liapunoff limit of error in the theory of probability. Arkiv f\u00f6r matematik, astronomioch fysik, A28:1--19, 1942."},{"key":"e_1_3_2_1_9_1","volume-title":"Probabilistic analysis of the (1+1)-evolutionary algorithm. CoRR, abs\/1409.4955","author":"Hwang H.","year":"2014","unstructured":"H. Hwang , A. Panholzer , N. Rolin , T. Tsai , and W. Chen . Probabilistic analysis of the (1+1)-evolutionary algorithm. CoRR, abs\/1409.4955 , 2014 . Available online from http:\/\/arxiv.org\/abs\/1409.4955. H. Hwang, A. Panholzer, N. Rolin, T. Tsai, and W. Chen. Probabilistic analysis of the (1+1)-evolutionary algorithm. CoRR, abs\/1409.4955, 2014. Available online from http:\/\/arxiv.org\/abs\/1409.4955."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_11_1","first-page":"15","volume-title":"Proc. PPSN'92","author":"M\u00fchlenbein H.","year":"1992","unstructured":"H. M\u00fchlenbein . How genetic algorithms really work: Mutation and hillclimbing . In Proc. PPSN'92 , pages 15 -- 26 . Elsevier , 1992 . H. M\u00fchlenbein. How genetic algorithms really work: Mutation and hillclimbing. In Proc. PPSN'92, pages 15--26. Elsevier, 1992."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2202241"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"}],"event":{"name":"GECCO '15: Genetic and Evolutionary Computation Conference","location":"Madrid Spain","acronym":"GECCO '15","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2739480.2754760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:18Z","timestamp":1750227378000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754760"}},"subtitle":["Speeding Up Evolutionary Algorithms Through Better Initialization"],"short-title":[],"issued":{"date-parts":[[2015,7,11]]},"references-count":14,"alternative-id":["10.1145\/2739480.2754760","10.1145\/2739480"],"URL":"https:\/\/doi.org\/10.1145\/2739480.2754760","relation":{},"subject":[],"published":{"date-parts":[[2015,7,11]]},"assertion":[{"value":"2015-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}