{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:51:28Z","timestamp":1759179088218,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,25]],"date-time":"2005-06-25T00:00:00Z","timestamp":1119657600000},"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":[[2005,6,25]]},"DOI":"10.1145\/1068009.1068124","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"679-686","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Not all linear functions are equally difficult for the compact genetic algorithm"],"prefix":"10.1145","author":[{"given":"Stefan","family":"Droste","sequence":"first","affiliation":[{"name":"Universit\u00e4t Dortmund, Dortmund, Germany"}]}],"member":"320","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/548530"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00137-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.700083"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/559621"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_8_1","first-page":"32","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, (7):19 --"},{"key":"e_1_3_2_1_9_1","first-page":"187","volume":"178","author":"M\u00fchlenbein H.","year":"1996","unstructured":"H. M\u00fchlenbein and G. Paa\u03b2 . From recombination of genes to the estimation of distributions I. Binary parameters. In Proceedings of PPSN IV, pages 178 -- 187 , 1996 . H. M\u00fchlenbein and G. Paa\u03b2. From recombination of genes to the estimation of distributions I. Binary parameters. In Proceedings of PPSN IV, pages 178 -- 187, 1996.","journal-title":"Binary parameters. In Proceedings of PPSN IV, pages"},{"key":"e_1_3_2_1_10_1","first-page":"275","volume-title":"Proceedings of GECCO 2000","author":"Pelikan M.","year":"2000","unstructured":"M. Pelikan , D. E. Goldberg , and E. Cant\u00f9-Paz . Bayesian optimization algorithm, population sizing, and time to convergence . In Proceedings of GECCO 2000 , pages 275 -- 282 , 2000 . M. Pelikan, D. E. Goldberg, and E. Cant\u00f9-Paz. Bayesian optimization algorithm, population sizing, and time to convergence. In Proceedings of GECCO 2000, pages 275 -- 282, 2000."},{"key":"e_1_3_2_1_11_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_12_1","first-page":"2005","volume":"2003","author":"Wegener I.","year":"2004","unstructured":"I. Wegener . Computational Complexity and EC. Tutorial at GECCO 2003 , 2004 , and 2005 . I. Wegener. Computational Complexity and EC. Tutorial at GECCO 2003, 2004, and 2005.","journal-title":"GECCO"},{"key":"e_1_3_2_1_13_1","first-page":"349","volume-title":"Evolutionary Optimization","author":"Wegener I.","year":"2002","unstructured":"I. Wegener . Methods for the analysis of evolutionary algorithms on pseudo-boolean functions . In R.Sarker, X.Yao, and M.Mohammadian, editors, Evolutionary Optimization , pages 349 -- 369 . Kluwer , 2002 . I. Wegener. Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In R.Sarker, X.Yao, and M.Mohammadian, editors, Evolutionary Optimization, pages 349 -- 369. Kluwer, 2002."}],"event":{"name":"GECCO05: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Washington DC USA","acronym":"GECCO05"},"container-title":["Proceedings of the 7th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1068009.1068124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:59Z","timestamp":1750262879000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,25]]},"references-count":13,"alternative-id":["10.1145\/1068009.1068124","10.1145\/1068009"],"URL":"https:\/\/doi.org\/10.1145\/1068009.1068124","relation":{},"subject":[],"published":{"date-parts":[[2005,6,25]]},"assertion":[{"value":"2005-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}