{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:38Z","timestamp":1750308098368,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"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.1068126","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"695-702","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["On the convergence of an estimation of distribution algorithm based on linkage discovery and factorization"],"prefix":"10.1145","author":[{"given":"Alden H.","family":"Wright","sequence":"first","affiliation":[{"name":"University of Montana, Missoula, Montana"}]},{"given":"Sandeep","family":"Pulavarty","sequence":"additional","affiliation":[{"name":"University of Montana, Missoula, Montana"}]}],"member":"320","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50014-1"},{"key":"e_1_3_2_1_2_1","first-page":"424","volume-title":"M. C. M. et. al.","author":"de Bonet J. S.","unstructured":"J. S. de Bonet , C. L. Isbell , Jr., and P. Viola . MIMIC: Finding optima by estimating probability densities . In M. C. M. et. al. , editor, Advances in Neural Information Processing Systems , volume 9 , page 424 . MIT Press, 1997. J. S. de Bonet, C. L. Isbell, Jr., and P. Viola. MIMIC: Finding optima by estimating probability densities. In M. C. M. et. al., editor, Advances in Neural Information Processing Systems, volume 9, page 424. MIT Press, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645513.657762"},{"key":"e_1_3_2_1_4_1","first-page":"247","volume-title":"Foundations of Genetic Algorithms 4","author":"Harik G. R.","year":"1997","unstructured":"G. R. Harik and D. E. Goldberg . Learning linkage . In R. K. Belew and M. D. Vose, editors, Foundations of Genetic Algorithms 4 , pages 247 -- 262 . Morgan Kaufmann , San Francisco, CA , 1997 . G. R. Harik and D. E. Goldberg. Learning linkage. In R. K. Belew and M. D. Vose, editors, Foundations of Genetic Algorithms 4, pages 247--262. Morgan Kaufmann, San Francisco, CA, 1997."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797971"},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1007\/3-540-45105-6_111","volume-title":"Erick Cant\u00fa Paz et al.","author":"Heckendorn R. E.","year":"2003","unstructured":"R. E. Heckendorn and A. H. Wright . Efficient linkage discovery by limited probing . In Erick Cant\u00fa Paz et al. , editor, Genetic and Evolutionary Computation - GECCO 2003 , Lecture Notes in Computer Science LNCS 2724, pages 1003 -- 10014 . Springer Verlag , 2003. R. E. Heckendorn and A. H. Wright. Efficient linkage discovery by limited probing. In Erick Cant\u00fa Paz et al., editor, Genetic and Evolutionary Computation - GECCO 2003, Lecture Notes in Computer Science LNCS 2724, pages 1003--10014. Springer Verlag, 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1162\/1063656043138914"},{"key":"e_1_3_2_1_8_1","volume-title":"Adapdation in Natural and Artificial Systems","author":"Holland J.","year":"1975","unstructured":"J. Holland . Adapdation in Natural and Artificial Systems . University of Michigan Press , Ann Arbor , Michigan, 1975 . J. Holland. Adapdation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan, 1975."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0888-613X(96)00069-2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-332-5.50050-X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542706"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/10636560151075112"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"S. L. Lauritzen. Graphical Models. Clarendon Press Oxford 1996. S. L. Lauritzen. Graphical Models. Clarendon Press Oxford 1996.","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1162\/1063656053583469"},{"issue":"1","key":"e_1_3_2_1_15_1","first-page":"19","article-title":"Convergence theory and application of the factorized distribution algorithm","volume":"7","author":"M\u00fchlenbein H.","year":"1999","unstructured":"H. M\u00fchlenbein and T. Mahnig . Convergence theory and application of the factorized distribution algorithm . Journal of Computing and Information Technology , 7 ( 1 ): 19 -- 32 , 1999 . H. M\u00fchlenbein and T. Mahnig. Convergence theory and application of the factorized distribution algorithm. Journal of Computing and Information Technology, 7(1):19--32, 1999.","journal-title":"Journal of Computing and Information Technology"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.4.353"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0888-613X(02)00093-2"},{"key":"e_1_3_2_1_18_1","first-page":"133","volume-title":"Foundations of genetic algorithms (FOGA-7)","author":"M\u00fchlenbein H.","year":"2003","unstructured":"H. M\u00fchlenbein and T. Mahnig . Evolutionary algorithms and the Boltzmann distribution . In Foundations of genetic algorithms (FOGA-7) , pages 133 -- 150 , San Mateo, 2003 . Morgan Kaufmann . H. M\u00fchlenbein and T. Mahnig. Evolutionary algorithms and the Boltzmann distribution. In Foundations of genetic algorithms (FOGA-7), pages 133--150, San Mateo, 2003. Morgan Kaufmann."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009689913453"},{"key":"e_1_3_2_1_20_1","series-title":"Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature PPSN IV","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"From recombination of genes to the estimation of distributions I, binary parameters","author":"M\u00fchlenbein H.","year":"1996","unstructured":"H. M\u00fchlenbein and G. Paa\u00df . From recombination of genes to the estimation of distributions I, binary parameters . In Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature PPSN IV , 1996 , pages 178 -- 187 . Springer Verlag , 1996. H. M\u00fchlenbein and G. Paa\u00df. From recombination of genes to the estimation of distributions I, binary parameters. In Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature PPSN IV, 1996, pages 178--187. Springer Verlag, 1996."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.4.377"},{"key":"e_1_3_2_1_22_1","first-page":"525","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99","author":"Pelikan M.","year":"1999","unstructured":"M. Pelikan , D. E. Goldberg , and E. Cant\u00fa-Paz . BOA: The Bayesian optimization algorithm . In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99 , volume I , pages 525 -- 532 , Orlando, FL , 13-17 1999 . Morgan Kaufmann Publishers , San Fransisco, CA. M. Pelikan, D. E. Goldberg, and E. Cant\u00fa-Paz. BOA: The Bayesian optimization algorithm. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, volume I, pages 525--532, Orlando, FL, 13-17 1999. Morgan Kaufmann Publishers, San Fransisco, CA."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365600750078808"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/978-1-4471-0819-1_39","volume-title":"Advances in Soft Computing -Engineering Design and Manufacturing","author":"Pelikan M.","year":"1999","unstructured":"M. Pelikan and H. M\u00fchlenbein . The bivariate marginal distribution algorithm . In R. Roy, T. Furuhashi, and P. K. Chawdhry, editors, Advances in Soft Computing -Engineering Design and Manufacturing , pages 521 -- 535 , London, 1999 . Springer-Verlag . M. Pelikan and H. M\u00fchlenbein. The bivariate marginal distribution algorithm. In R. Roy, T. Furuhashi, and P. K. Chawdhry, editors, Advances in Soft Computing -Engineering Design and Manufacturing, pages 521--535, London, 1999. Springer-Verlag."},{"key":"e_1_3_2_1_25_1","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Kalyanmoy Deb et al.","author":"Streeter M. J.","year":"2003","unstructured":"M. J. Streeter . Upper bounds on the time and space complexity of optimizing additively separable functions . In Kalyanmoy Deb et al. , editor, Genetic and Evolutionary Computation - GECCO 2003 , procedings part II, Lecture Notes in Computer Science LNCS 3103, pages 186 -- 197 . Springer Verlag , 2004. M. J. Streeter. Upper bounds on the time and space complexity of optimizing additively separable functions. In Kalyanmoy Deb et al., editor, Genetic and Evolutionary Computation - GECCO 2003, procedings part II, Lecture Notes in Computer Science LNCS 3103, pages 186--197. Springer Verlag, 2004."},{"key":"e_1_3_2_1_26_1","volume-title":"Katholieke Universiteit Leuven","author":"Thierens D.","year":"1995","unstructured":"D. Thierens . Analysis and design of genetic algorithms. PhD thesis , Katholieke Universiteit Leuven , Leuven, Belgium , 1995 . D. Thierens. Analysis and design of genetic algorithms. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 1995."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.819431"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.820663"}],"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.1068126","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1068009.1068126","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.1068126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,25]]},"references-count":28,"alternative-id":["10.1145\/1068009.1068126","10.1145\/1068009"],"URL":"https:\/\/doi.org\/10.1145\/1068009.1068126","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"}}]}}