{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:55Z","timestamp":1750220755864,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Det Frie Forskningsr\u00e5d","award":["8021-00260B"],"award-info":[{"award-number":["8021-00260B"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3377929.3389888","type":"proceedings-article","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T15:26:58Z","timestamp":1598455618000},"page":"1254-1282","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Theory of estimation-of-distribution algorithms"],"prefix":"10.1145","author":[{"given":"Carsten","family":"Witt","sequence":"first","affiliation":[{"name":"Technical University of Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/645822.758240"},{"key":"e_1_3_2_1_3_1","first-page":"453","volume-title":"Proc. of CEC '07","author":"Chen T.","year":"2007","unstructured":"T. Chen , K. Tang , G. Chen , and X. Yao . On the analysis of average time complexity of estimation of distribution algorithms . In Proc. of CEC '07 , pages 453 -- 460 . IEEE Press , 2007 . T. Chen, K. Tang, G. Chen, and X. Yao. On the analysis of average time complexity of estimation of distribution algorithms. In Proc. of CEC '07, pages 453--460. IEEE Press, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/1689599.1689793"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.5555\/1689599.1689885"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/TITB.2009.2039678"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/TEVC.2017.2753538"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/2739480.2754814"},{"key":"e_1_3_2_1_9_1","first-page":"424","volume-title":"Proc. of NIPS '96","author":"De Bonet J. S.","year":"1997","unstructured":"J. S. De Bonet , C. L. Isbell , Jr, and P. A. Viola . MIMIC: Finding optima by estimating probability densities . In Proc. of NIPS '96 , pages 424 -- 430 . MIT Press , 1997 . J. S. De Bonet, C. L. Isbell, Jr, and P. A. Viola. MIMIC: Finding optima by estimating probability densities. In Proc. of NIPS '96, pages 424--430. MIT Press, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/3299904.3340304"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/3321707.3321747"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/3205455.3205553"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/2330163.2330167"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/2739480.2754678"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/s11047-006-9001-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/2460239.2460246"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/2908812.2908895"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1162\/EVCO_a_00178"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/TEVC.2016.2613739"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1162\/1063656053583423"},{"issue":"4","key":"e_1_3_2_1_21_1","first-page":"465","article-title":"Analyzing the PBIL algorithm by means of discrete dynamical systems","volume":"12","author":"Gonz\u00e1lez C.","year":"2000","unstructured":"C. Gonz\u00e1lez , J. Lozano , and P. Larra\u00f1aga . Analyzing the PBIL algorithm by means of discrete dynamical systems . Complex Systems , 12 ( 4 ): 465 -- 479 , 2000 . C. Gonz\u00e1lez, J. Lozano, and P. Larra\u00f1aga. Analyzing the PBIL algorithm by means of discrete dynamical systems. Complex Systems, 12(4):465--479, 2000.","journal-title":"Complex Systems"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1007\/978-3-540-34954-9_3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/3205455.3205608"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1016\/j.swevo.2011.08.003"},{"key":"e_1_3_2_1_25_1","first-page":"1","volume-title":"Proc. of CEC 97","author":"H\u00f6hfeld M.","year":"1997","unstructured":"M. H\u00f6hfeld and G. Rudolph . Towards a theory of population-based incremental learning . In Proc. of CEC 97 , pages 1 -- 5 . IEEE Press , 1997 . M. H\u00f6hfeld and G. Rudolph. Towards a theory of population-based incremental learning. In Proc. of CEC 97, pages 1--5. IEEE Press, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.5555\/2842865"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/3040718.3040724"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1007\/978-1-4615-1539-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/3071178.3071317"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1007\/978-3-319-99259-4_9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3321707.3321834"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/1830483.1830747"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/3205455.3205576"},{"key":"e_1_3_2_1_34_1","first-page":"151","volume-title":"Proc. of GECCO '00","author":"Lobo F. G.","year":"2000","unstructured":"F. G. Lobo , D. E. Goldberg , and M. Pelikan . Time complexity of genetic algorithms on exponentially scaled problems . In Proc. of GECCO '00 , pages 151 -- 158 . Morgan Kaufmann , 2000 . F. G. Lobo, D. E. Goldberg, and M. Pelikan. Time complexity of genetic algorithms on exponentially scaled problems. In Proc. of GECCO '00, pages 151--158. Morgan Kaufmann, 2000."},{"key":"e_1_3_2_1_35_1","first-page":"15","volume-title":"Proc. of PPSN '92","author":"M\u00fchlenbein H.","year":"1992","unstructured":"H. M\u00fchlenbein . How genetic algorithms really work: Mutation and hillclimbing . In Proc. of PPSN '92 , pages 15 -- 26 . North Holland , 1992 . H. M\u00fchlenbein. How genetic algorithms really work: Mutation and hillclimbing. In Proc. of PPSN '92, pages 15--26. North Holland, 1992."},{"key":"e_1_3_2_1_36_1","first-page":"19","article-title":"Convergence theory and applications of the factorized distribution algorithm","volume":"7","author":"M\u00fchlenbein H.","year":"1999","unstructured":"H. M\u00fchlenbein and T. Mahnig . Convergence theory and applications of the factorized distribution algorithm . Journal of Computing and Information Technology , 7 : 19 -- 32 , 1999 . H. M\u00fchlenbein and T. Mahnig. Convergence theory and applications of the factorized distribution algorithm. Journal of Computing and Information Technology, 7:19--32, 1999.","journal-title":"Journal of Computing and Information Technology"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1162\/evco.1999.7.4.353"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1145\/1830483.1830493"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1007\/978-1-4471-0819-1_39"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.5555\/1215874"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1007\/978-3-662-43505-2_45"},{"key":"e_1_3_2_1_42_1","volume-title":"Convergence properties of evolutionary algorithms","author":"Rudolph G.","year":"1997","unstructured":"G. Rudolph . Convergence properties of evolutionary algorithms . Verlag Dr . Kova\u010d, 1997 . G. Rudolph. Convergence properties of evolutionary algorithms. Verlag Dr. Kova\u010d, 1997."},{"key":"e_1_3_2_1_43_1","first-page":"115","volume-title":"Proc. of FOGA '02","author":"Shapiro J. L.","year":"2003","unstructured":"J. L. Shapiro . The sensitivity of PBIL to its learning rate, and how detailed balance can remove it . In Proc. of FOGA '02 , pages 115 -- 132 . Morgan Kaufmann , 2003 . J. L. Shapiro. The sensitivity of PBIL to its learning rate, and how detailed balance can remove it. In Proc. of FOGA '02, pages 115--132. Morgan Kaufmann, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1162\/1063656053583414"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1007\/11844297_10"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.1016\/S0167-739X(00)00043-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1007\/s00453-011-9606-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_48_1","DOI":"10.1145\/2908812.2908867"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_49_1","DOI":"10.1007\/s00453-018-0480-z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1109\/ICEC.1998.700085"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_51_1","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_52_1","first-page":"1415","volume-title":"Proc. of GECCO '17","author":"Upper C. W.","year":"2017","unstructured":"C. W. Upper bounds on the runtime of the univariate marginal distribution algorithm on OneMax . In Proc. of GECCO '17 , pages 1415 -- 1422 . ACM Press , 2017 . C. W. Upper bounds on the runtime of the univariate marginal distribution algorithm on OneMax. In Proc. of GECCO '17, pages 1415--1422. ACM Press, 2017."},{"key":"e_1_3_2_1_53_1","first-page":"1539","volume-title":"Proc. of GECCO '18","author":"C. W.","year":"2018","unstructured":"C. W. Domino convergence : Why one should hill-climb on linear functions . In Proc. of GECCO '18 , pages 1539 -- 1546 . ACM Press , 2018 . C. W. Domino convergence: Why one should hill-climb on linear functions. In Proc. of GECCO '18, pages 1539--1546. ACM Press, 2018."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_54_1","DOI":"10.1109\/TEVC.2014.2336882"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_55_1","DOI":"10.1109\/TEVC.2017.2667713"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_56_1","DOI":"10.5555\/1067675.1067676"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_57_1","DOI":"10.1109\/TEVC.2003.819431"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_58_1","DOI":"10.1109\/TEVC.2003.820663"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '20","name":"GECCO '20: Genetic and Evolutionary Computation Conference","location":"Canc\u00fan Mexico"},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377929.3389888","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377929.3389888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:39:00Z","timestamp":1750199940000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377929.3389888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":57,"alternative-id":["10.1145\/3377929.3389888","10.1145\/3377929"],"URL":"https:\/\/doi.org\/10.1145\/3377929.3389888","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}