{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:11:11Z","timestamp":1778249471841,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"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":[[2008,7,12]]},"DOI":"10.1145\/1389095.1389172","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"415-422","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Using previous models to bias structural learning in the hierarchical BOA"],"prefix":"10.1145","author":[{"given":"Mark W.","family":"Hauschild","sequence":"first","affiliation":[{"name":"University of Missouri - St. Louis, St. Louis, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pelikan","sequence":"additional","affiliation":[{"name":"University of Missouri - St. Louis, St. Louis, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kumara","family":"Sastry","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David E.","family":"Goldberg","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-3-540-34954-9_9","volume-title":"Scalable optimization via probabilistic modeling: From algorithms to applications","author":"Baluja S.","year":"2006","unstructured":"S. Baluja . Incorporating a priori knowledge in probabilistic-model based optimization . In M. Pelikan, K. Sastry, and E. Cantu-Paz, editors, Scalable optimization via probabilistic modeling: From algorithms to applications , pages 205 -- 219 . Springer , 2006 . S. Baluja. Incorporating a priori knowledge in probabilistic-model based optimization. In M. Pelikan, K. Sastry, and E. Cantu-Paz, editors, Scalable optimization via probabilistic modeling: From algorithms to applications, pages 205--219. Springer, 2006."},{"key":"e_1_3_2_1_2_1","first-page":"379","volume-title":"International Conference on Computational Intelligence","author":"Boughaci D.","year":"2004","unstructured":"D. Boughaci and H. Drias . A performance comparison of evolutionary meta-heuristics and solving MAX-SAT problems. In A. Okatan, editor , International Conference on Computational Intelligence , pages 379 -- 383 . International Computational Intelligence Society , 2004 . D. Boughaci and H. Drias. A performance comparison of evolutionary meta-heuristics and solving MAX-SAT problems. In A. Okatan, editor, International Conference on Computational Intelligence, pages 379--383. International Computational Intelligence Society, 2004."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1274000.1274005"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.097201"},{"key":"e_1_3_2_1_6_1","first-page":"421","volume-title":"Graphical models","author":"Friedman N.","year":"1999","unstructured":"N. Friedman and M. Goldszmidt . Learning Bayesian networks with local structure . In M. I. Jordan, editor, Graphical models , pages 421 -- 459 . MIT Press , 1999 . N. Friedman and M. Goldszmidt. Learning Bayesian networks with local structure. In M. I. Jordan, editor, Graphical models, pages 421--459. MIT Press, 1999."},{"key":"e_1_3_2_1_7_1","first-page":"654","volume-title":"Proceedings of the American Association of Artificial Intelligence (AAAI-99)","author":"Gent I.","year":"1999","unstructured":"I. Gent , H. H. Hoos , P. Prosser , and T. Walsh . Morphing: Combining structure and randomness . Proceedings of the American Association of Artificial Intelligence (AAAI-99) , pages 654 -- 660 , 1999 . I. Gent, H. H. Hoos, P. Prosser, and T. Walsh. Morphing: Combining structure and randomness. Proceedings of the American Association of Artificial Intelligence (AAAI-99), pages 654--660, 1999."},{"key":"e_1_3_2_1_8_1","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 . Kluwer , 2002 . D. E. Goldberg. The design of innovation: Lessons from and for competent genetic algorithms. Kluwer, 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602317301763"},{"key":"e_1_3_2_1_10_1","first-page":"24","volume-title":"International Conference on Genetic Algorithms (ICGA-95)","author":"Harik G. R.","year":"1995","unstructured":"G. R. Harik . Finding multimodal solutions using restricted tournament selection . International Conference on Genetic Algorithms (ICGA-95) , pages 24 -- 31 , 1995 . G. R. Harik. Finding multimodal solutions using restricted tournament selection. International Conference on Genetic Algorithms (ICGA-95), pages 24--31, 1995."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277070"},{"key":"e_1_3_2_1_12_1","first-page":"283","volume-title":"SAT 2000","author":"Hoos H. H.","year":"2000","unstructured":"H. H. Hoos and T. Stutzle . Satlib: An online resource for research on sat . SAT 2000 , pages 283 -- 292 , 2000 . SATLIB is available online at www.satlib.org. H. H. Hoos and T. Stutzle. Satlib: An online resource for research on sat. SAT 2000, pages 283--292, 2000. SATLIB is available online at www.satlib.org."},{"key":"e_1_3_2_1_13_1","first-page":"721","volume-title":"Readings on the principles and applications of decision analysis","author":"Howard R. A.","year":"1981","unstructured":"R. A. Howard and J. E. Matheson . Influence diagrams . In R. A. Howard and J. E. Matheson, editors, Readings on the principles and applications of decision analysis , volume II , pages 721 -- 762 . Strategic Decisions Group , Menlo Park, CA , 1981 . R. A. Howard and J. E. Matheson. Influence diagrams. In R. A. Howard and J. E. Matheson, editors, Readings on the principles and applications of decision analysis, volume II, pages 721--762. Strategic Decisions Group, Menlo Park, CA, 1981."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0888-613X(02)00093-2"},{"key":"e_1_3_2_1_16_1","volume-title":"Morgan Kaufmann","author":"Pearl J.","year":"1988","unstructured":"J. Pearl . Probabilistic reasoning in intelligent systems: Networks of plausible inference . Morgan Kaufmann , San Mateo, CA , 1988 . J. Pearl. Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Mateo, CA, 1988."},{"key":"e_1_3_2_1_17_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_18_1","first-page":"511","volume-title":"Genetic and Evolutionary Computation Conference (GECCO-2001)","author":"Pelikan M.","year":"2001","unstructured":"M. Pelikan and D. E. Goldberg . Escaping hierarchical traps with competent genetic algorithms . Genetic and Evolutionary Computation Conference (GECCO-2001) , pages 511 -- 518 , 2001 . M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. Genetic and Evolutionary Computation Conference (GECCO-2001), pages 511--518, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756582.1756586"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013500812258"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-34954-9","volume-title":"Scalable optimization via probabilistic modeling: From algorithms to applications","author":"Pelikan M.","year":"2006","unstructured":"M. Pelikan , K. Sastry , and E. Cant\u00b4u-Paz , editors . Scalable optimization via probabilistic modeling: From algorithms to applications . Springer-Verlag , 2006 . M. Pelikan, K. Sastry, and E. Cant\u00b4u-Paz, editors. Scalable optimization via probabilistic modeling: From algorithms to applications. Springer-Verlag, 2006."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0888-613X(02)00095-6"},{"key":"e_1_3_2_1_23_1","first-page":"785","volume-title":"Genetic algorithm behavior in the MAXSAT domain. Parallel Problem Solving from Nature","author":"Rana S.","year":"1998","unstructured":"S. Rana and D. L. Whitley . Genetic algorithm behavior in the MAXSAT domain. Parallel Problem Solving from Nature , pages 785 -- 794 , 1998 . S. Rana and D. L. Whitley. Genetic algorithm behavior in the MAXSAT domain. Parallel Problem Solving from Nature, pages 785--794, 1998."},{"key":"e_1_3_2_1_24_1","volume-title":"Efficient atomic cluster optimization using a hybrid extended compact genetic algorithm with seeded population. IlliGAL Report No. 2001018","author":"Sastry K.","year":"2001","unstructured":"K. Sastry . Efficient atomic cluster optimization using a hybrid extended compact genetic algorithm with seeded population. IlliGAL Report No. 2001018 , University of Illinois at Urbana-Champaign , Illinois Genetic Algorithms Laboratory, Urbana, IL, 2001 . K. Sastry. Efficient atomic cluster optimization using a hybrid extended compact genetic algorithm with seeded population. IlliGAL Report No. 2001018, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 2001."},{"key":"e_1_3_2_1_25_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 , Department of General Engineering, Urbana, IL, 2001 . K. Sastry. Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL, 2001."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-540-34954-9_7","volume-title":"Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications","author":"Sastry K.","year":"2006","unstructured":"K. Sastry , M. Pelikan , and D. E. Goldberg . Efficiency enhancement of estimation of distribution algorithms . In M. Pelikan, K. Sastry, and E. Cantu-Paz, editors, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications , pages 161 -- 185 . Springer , 2006 . K. Sastry, M. Pelikan, and D. E. Goldberg. Efficiency enhancement of estimation of distribution algorithms. In M. Pelikan, K. Sastry, and E. Cantu-Paz, editors, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, pages 161--185. Springer, 2006."},{"key":"e_1_3_2_1_27_1","volume-title":"A problem-knowledge based evolutionary algorithm KBOA for hypergraph partitioning","author":"Schwarz J.","year":"2000","unstructured":"J. Schwarz and J. Ocenasek . A problem-knowledge based evolutionary algorithm KBOA for hypergraph partitioning , 2000 . Personal communication. J. Schwarz and J. Ocenasek. A problem-knowledge based evolutionary algorithm KBOA for hypergraph partitioning, 2000. Personal communication."},{"key":"e_1_3_2_1_28_1","volume-title":"http:\/\/www.informatik.uni-koeln.de\/ls_juenger\/research\/sgs\/sgs.html","author":"Ground State Server Spin Glass","year":"2004","unstructured":"Spin Glass Ground State Server . http:\/\/www.informatik.uni-koeln.de\/ls_juenger\/research\/sgs\/sgs.html , 2004 . University of Koln , Germany . Spin Glass Ground State Server. http:\/\/www.informatik.uni-koeln.de\/ls_juenger\/research\/sgs\/sgs.html, 2004. University of Koln, Germany."}],"event":{"name":"GECCO08: Genetic and Evolutionary Computation Conference","location":"Atlanta GA USA","acronym":"GECCO08","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 10th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389172","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:41Z","timestamp":1750255001000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":27,"alternative-id":["10.1145\/1389095.1389172","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389172","relation":{},"subject":[],"published":{"date-parts":[[2008,7,12]]},"assertion":[{"value":"2008-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}