{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:53Z","timestamp":1759638593646,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["4002-00542"],"award-info":[{"award-number":["4002-00542"]}],"id":[{"id":"10.13039\/100008394","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1145\/3071178.3071216","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"1415-1422","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax"],"prefix":"10.1145","author":[{"given":"Carsten","family":"Witt","sequence":"first","affiliation":[{"name":"Technical University of Denmark, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1689599.1689793"},{"key":"e_1_3_2_1_2_1","first-page":"453","volume-title":"Proc. of CEC '07","author":"Chen Tianshi","year":"2007","unstructured":"Tianshi Chen , Ke Tang , Guoliang Chen , and Xin Yao . On the analysis of average time complexity of estimation of distribution algorithms . In Proc. of CEC '07 , pages 453 -- 460 . IEEE Press , 2007 . Tianshi Chen, Ke Tang, Guoliang Chen, and Xin Yao. On the analysis of average time complexity of estimation of distribution algorithms. In Proc. of CEC '07, pages 453--460. IEEE Press, 2007."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1689599.1689885"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2040019"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754814"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9001-0"},{"key":"e_1_3_2_1_7_1","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller William","year":"1971","unstructured":"William Feller . An Introduction to Probability Theory and Its Applications , volume 2 . Wiley , 1971 . William Feller. An Introduction to Probability Theory and Its Applications, volume 2. Wiley, 1971."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908895"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48971-0_13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.08.003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3040718.3040724"},{"key":"e_1_3_2_1_12_1","series-title":"Genetic Algorithms and Evolutionary Computation","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1539-5","volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"Larra\u00f1aga Pedro","year":"2002","unstructured":"Pedro Larra\u00f1aga and Jose A. Lozano , editors . Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , volume 2 of Genetic Algorithms and Evolutionary Computation . Springer , 2002 . Pedro Larra\u00f1aga and Jose A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, volume 2 of Genetic Algorithms and Evolutionary Computation. Springer, 2002."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071317"},{"key":"e_1_3_2_1_14_1","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics, page 195--247","author":"McDiarmid Colin","year":"1998","unstructured":"Colin McDiarmid . Concentration . In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, page 195--247 . Springer , 1998 . Colin McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, page 195--247. Springer, 1998."},{"key":"e_1_3_2_1_15_1","first-page":"178","volume-title":"Proc. of PPSN IV","author":"M\u00fchlenbein Heinz","year":"1996","unstructured":"Heinz M\u00fchlenbein and Gerhard Paass . From Recombination of Genes to the Estimation of Distributions I. Binary Parameters . In Proc. of PPSN IV , pages 178 -- 187 . Springer , 1996 . Heinz M\u00fchlenbein and Gerhard Paass. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. In Proc. of PPSN IV, pages 178--187. Springer, 1996."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830493"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.002"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2202241"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908867"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Carsten Witt. Upper bounds on the runtime of the univariate marginal distribution algorithm on OneMax. Tech. rep. http:\/\/arxiv.org\/abs\/1704.00026 2017.  Carsten Witt. Upper bounds on the runtime of the univariate marginal distribution algorithm on OneMax. Tech. rep. http:\/\/arxiv.org\/abs\/1704.00026 2017.","DOI":"10.1145\/3071178.3071216"}],"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"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071216","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:05Z","timestamp":1750220645000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":22,"alternative-id":["10.1145\/3071178.3071216","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071216","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"2017-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}