{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:39Z","timestamp":1759847799973,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["CA15140"],"award-info":[{"award-number":["CA15140"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Investissement d'avenir project in a joint call with Gaspard Monge Program for optimization, operations research and their interactions with data sciences","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,25]]},"DOI":"10.1145\/3377930.3390177","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:29:12Z","timestamp":1593458952000},"page":"796-804","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Bivariate estimation-of-distribution algorithms can find an exponential number of optima"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin S.","family":"Krejca","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11030-006-9053-1"},{"volume-title":"Proc. of NIPS '96","author":"De Bonet Jeremy S.","key":"e_1_3_2_1_2_1","unstructured":"Jeremy S. De Bonet , Charles Lee Isbell Jr ., and Paul A. Viola . 1996. MIMIC: finding optima by estimating probability densities . In Proc. of NIPS '96 . 424--430. http:\/\/papers.nips.cc\/paper\/1328-mimic-finding-optima-by-estimating-probability-densities Jeremy S. De Bonet, Charles Lee Isbell Jr., and Paul A. Viola. 1996. MIMIC: finding optima by estimating probability densities. In Proc. of NIPS '96. 424--430. http:\/\/papers.nips.cc\/paper\/1328-mimic-finding-optima-by-estimating-probability-densities"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830544"},{"volume-title":"Proc. of EvoCOP '20","author":"Doerr Benjamin","key":"e_1_3_2_1_5_1","unstructured":"Benjamin Doerr and Martin S. Krejca . 2020. The univariate marginal distribution algorithm copes well with deception and epistasis . In Proc. of EvoCOP '20 . To appear. Benjamin Doerr and Martin S. Krejca. 2020. The univariate marginal distribution algorithm copes well with deception and epistasis. In Proc. of EvoCOP '20. To appear."},{"key":"e_1_3_2_1_6_1","volume-title":"Sharp bounds for genetic drift in EDAs. CoRR abs\/1910.14389","author":"Doerr Benjamin","year":"2019","unstructured":"Benjamin Doerr and Weijie Zheng . 2019. Sharp bounds for genetic drift in EDAs. CoRR abs\/1910.14389 ( 2019 ). https:\/\/arxiv.org\/abs\/1910.14389 Benjamin Doerr and Weijie Zheng. 2019. Sharp bounds for genetic drift in EDAs. CoRR abs\/1910.14389 (2019). https:\/\/arxiv.org\/abs\/1910.14389"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908895"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797971"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34954-9_3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277070"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.1.81"},{"volume-title":"Probabilistic graphical models: principles and techniques","author":"Koller Daphne","key":"e_1_3_2_1_12_1","unstructured":"Daphne Koller and Nir Friedman . 2009. Probabilistic graphical models: principles and techniques . The MIT Press . Daphne Koller and Nir Friedman. 2009. Probabilistic graphical models: principles and techniques. The MIT Press."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340316"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61723-X_982"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542701"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1162\/1063656053583432"},{"volume-title":"Proc. of GECCO '01","author":"Pelikan Martin","key":"e_1_3_2_1_19_1","unstructured":"Martin Pelikan and David E. Goldberg . 2001. Escaping hierarchical traps with competent genetic algorithms . In Proc. of GECCO '01 . 511--518. https:\/\/dl.acm.org\/doi\/10.5555\/2955239.2955318 Martin Pelikan and David E. Goldberg. 2001. Escaping hierarchical traps with competent genetic algorithms. In Proc. of GECCO '01. 511--518. https:\/\/dl.acm.org\/doi\/10.5555\/2955239.2955318"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45110-2_3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43505-2_45"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0819-1_39"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144200"}],"event":{"name":"GECCO '20: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Canc\u00fan Mexico","acronym":"GECCO '20"},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390177","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377930.3390177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:07Z","timestamp":1750200067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,25]]},"references-count":21,"alternative-id":["10.1145\/3377930.3390177","10.1145\/3377930"],"URL":"https:\/\/doi.org\/10.1145\/3377930.3390177","relation":{},"subject":[],"published":{"date-parts":[[2020,6,25]]},"assertion":[{"value":"2020-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}