{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:17Z","timestamp":1750307417274,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T00:00:00Z","timestamp":1278460800000},"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":[[2010,7,7]]},"DOI":"10.1145\/1830483.1830543","type":"proceedings-article","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T22:03:17Z","timestamp":1278885797000},"page":"303-310","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Spurious dependencies and EDA scalability"],"prefix":"10.1145","author":[{"given":"Elizabeth","family":"Radetic","sequence":"first","affiliation":[{"name":"University of Missouri in St. Louis, St. Louis, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pelikan","sequence":"additional","affiliation":[{"name":"University of Missouri in St. Louis, St. Louis, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"30","volume-title":"International Conference on Machine Learning","author":"Baluja S.","year":"1997","unstructured":"S. Baluja and S. Davies . Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space . International Conference on Machine Learning , pages 30 -- 38 , 1997 . S. Baluja and S. Davies. Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. International Conference on Machine Learning, pages 30--38, 1997."},{"key":"e_1_3_2_1_2_1","volume-title":"MIMIC: Finding optima by estimating probability densities. Advances in neural information processing systems (NIPS-97), 9:424--431","author":"De Bonet J. S.","year":"1997","unstructured":"J. S. De Bonet , C. L. Isbell , and P. Viola . MIMIC: Finding optima by estimating probability densities. Advances in neural information processing systems (NIPS-97), 9:424--431 , 1997 . J. S. De Bonet, C. L. Isbell, and P. Viola. MIMIC: Finding optima by estimating probability densities. Advances in neural information processing systems (NIPS-97), 9:424--431, 1997."},{"key":"e_1_3_2_1_3_1","volume-title":"An introduction to probability theory and its applications","author":"Feller W.","year":"1970","unstructured":"W. Feller . An introduction to probability theory and its applications . Wiley , New York, NY , 1970 . W. Feller. An introduction to probability theory and its applications. Wiley, New York, NY, 1970."},{"key":"e_1_3_2_1_4_1","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"Goldberg D. E.","year":"1989","unstructured":"D. E. Goldberg . Genetic algorithms in search, optimization, and machine learning . Addison-Wesley , Reading, MA , 1989 . D. E. Goldberg. Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA, 1989."},{"key":"e_1_3_2_1_5_1","series-title":"Genetic Algorithms and Evolutionary Computation","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3643-4","volume-title":"The design of innovation: Lessons from and for competent genetic algorithms","author":"Goldberg D. E.","year":"2002","unstructured":"D. E. Goldberg . The design of innovation: Lessons from and for competent genetic algorithms , volume 7 of Genetic Algorithms and Evolutionary Computation . Kluwer , 2002 . D. E. Goldberg. The design of innovation: Lessons from and for competent genetic algorithms, volume 7 of Genetic Algorithms and Evolutionary Computation. Kluwer, 2002."},{"key":"e_1_3_2_1_6_1","first-page":"333","article-title":"Genetic algorithms, noise, and the sizing of populations","volume":"6","author":"Goldberg D. E.","year":"1992","unstructured":"D. E. Goldberg , K. Deb , and J. H. Clark . Genetic algorithms, noise, and the sizing of populations . Complex Systems , 6 : 333 -- 362 , 1992 . D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333--362, 1992.","journal-title":"Complex Systems"},{"key":"e_1_3_2_1_7_1","first-page":"336","volume-title":"Genetic and Evolutionary Comp. Conf. (GECCO-2001)","author":"Goldberg D. E.","year":"2001","unstructured":"D. E. Goldberg , K. Sastry , and T. Latoza . On the supply of building blocks . Genetic and Evolutionary Comp. Conf. (GECCO-2001) , pages 336 -- 342 , 2001 . D. E. Goldberg, K. Sastry, and T. Latoza. On the supply of building blocks. Genetic and Evolutionary Comp. Conf. (GECCO-2001), pages 336--342, 2001."},{"key":"e_1_3_2_1_8_1","volume-title":"Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010","author":"Harik G.","year":"1999","unstructured":"G. Harik . Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010 , University of Illinois at Urbana-Champaign , Illinois Genetic Algorithms Laboratory, Urbana, IL, 1999 . G. Harik. Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1999."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.3.231"},{"key":"e_1_3_2_1_10_1","first-page":"24","volume-title":"International Conf. on Genetic Algorithms (ICGA-95)","author":"Harik G. R.","year":"1995","unstructured":"G. R. Harik . Finding multimodal solutions using restricted tournament selection . International Conf. on Genetic Algorithms (ICGA-95) , pages 24 -- 31 , 1995 . G. R. Harik. Finding multimodal solutions using restricted tournament selection. International Conf. on Genetic Algorithms (ICGA-95), pages 24--31, 1995."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.700083"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277070"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202009"},{"key":"e_1_3_2_1_14_1","volume-title":"University of Michigan Press","author":"Holland J. H.","year":"1975","unstructured":"J. H. Holland . Adaptation in natural and artificial systems . University of Michigan Press , Ann Arbor, MI , 1975 . J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389174"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424590"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_24"},{"key":"e_1_3_2_1_19_1","volume-title":"Extended compact genetic algorithm in C++, version 1.1. IlliGAL Report No. 2006012","author":"Lobo F. G.","year":"2006","unstructured":"F. G. Lobo , K. Sastry , and G. R. Harik . Extended compact genetic algorithm in C++, version 1.1. IlliGAL Report No. 2006012 , University of Illinois at Urbana-Champaign , Illinois Genetic Algorithms Laboratory, Urbana, IL, 2006 . F. G. Lobo, K. Sastry, and G. R. Harik. Extended compact genetic algorithm in C++, version 1.1. IlliGAL Report No. 2006012, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 2006."},{"key":"e_1_3_2_1_20_1","first-page":"178","volume-title":"From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature","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. Parallel Problem Solving from Nature , pages 178 -- 187 , 1996 . H. M\u00fchlenbein and G. Paa\u00df. From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature, pages 178--187, 1996."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1993.1.1.25"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","DOI":"10.1007\/b10910","volume-title":"Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms","author":"Pelikan M.","year":"2005","unstructured":"M. Pelikan . Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms . Springer-Verlag , 2005 . M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer-Verlag, 2005."},{"key":"e_1_3_2_1_23_1","volume-title":"Genetic and Evolutionary Computation Conf. (GECCO-99)","author":"Pelikan M.","year":"1999","unstructured":"M. Pelikan , D. E. Goldberg , and E. Cant\u00fa-Paz . BOA: The Bayesian optimization algorithm . Genetic and Evolutionary Computation Conf. (GECCO-99) , I:525--532, 1999 . M. Pelikan, D. E. Goldberg, and E. Cant\u00fa-Paz. BOA: The Bayesian optimization algorithm. Genetic and Evolutionary Computation Conf. (GECCO-99), I:525--532, 1999."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013500812258"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0819-1_39"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0888-613X(02)00095-6"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554856"},{"key":"e_1_3_2_1_28_1","volume-title":"Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis","author":"Sastry K.","year":"2001","unstructured":"K. Sastry . Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis , University of Illinois at Urbana-Champaign , 2001 . K. Sastry. Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, 2001."},{"key":"e_1_3_2_1_29_1","first-page":"352","volume-title":"Late Breaking Paper in Genetic and Evol. Comp. Conf. (GECCO-2000)","author":"Sastry K.","year":"2000","unstructured":"K. Sastry and D. E. Goldberg . On extended compact genetic algorithm . In Late Breaking Paper in Genetic and Evol. Comp. Conf. (GECCO-2000) , pages 352 -- 359 , 2000 . K. Sastry and D. E. Goldberg. On extended compact genetic algorithm. In Late Breaking Paper in Genetic and Evol. Comp. Conf. (GECCO-2000), pages 352--359, 2000."},{"key":"e_1_3_2_1_30_1","volume-title":"The Sciences of the Artificial","author":"Simon H. A.","year":"1968","unstructured":"H. A. Simon . The Sciences of the Artificial . The MIT Press , Cambridge, MA , 1968 . H. A. Simon. The Sciences of the Artificial. The MIT Press, Cambridge, MA, 1968."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.4.331"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144078"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24855-2_32"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068209"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277080"}],"event":{"name":"GECCO '10: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Portland Oregon USA","acronym":"GECCO '10"},"container-title":["Proceedings of the 12th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830543","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1830483.1830543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:38Z","timestamp":1750246778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830543"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,7]]},"references-count":35,"alternative-id":["10.1145\/1830483.1830543","10.1145\/1830483"],"URL":"https:\/\/doi.org\/10.1145\/1830483.1830543","relation":{},"subject":[],"published":{"date-parts":[[2010,7,7]]},"assertion":[{"value":"2010-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}