{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T13:06:26Z","timestamp":1790859986069,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":28,"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.1830606","type":"proceedings-article","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T22:03:17Z","timestamp":1278885797000},"page":"665-672","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["NK landscapes, problem difficulty, and hybrid evolutionary algorithms"],"prefix":"10.1145","author":[{"given":"Martin","family":"Pelikan","sequence":"first","affiliation":[{"name":"University of Missouri in St. Louis, St. Louis, MO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765642.1765657"},{"key":"e_1_3_2_1_2_1","volume-title":"Handbook of Evolutionary Computation","author":"Altenberg L.","year":"1997","unstructured":"L. Altenberg . NK landscapes . In T. B\u00e4ck, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation , pages B2.7:5--10. Institute of Physics Publishing and Oxford University Press , 1997 . L. Altenberg. NK landscapes. In T. B\u00e4ck, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages B2.7:5--10. Institute of Physics Publishing and Oxford University Press, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00176-X"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068212"},{"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","volume-title":"An analysis of phase transition in NK landscapes. Journal of Artificial Intelligence Research (JAIR), 17:309--332","author":"Gao Y.","year":"2002","unstructured":"Y. Gao and J. C. Culberson . An analysis of phase transition in NK landscapes. Journal of Artificial Intelligence Research (JAIR), 17:309--332 , 2002 . Y. Gao and J. C. Culberson. An analysis of phase transition in NK landscapes. Journal of Artificial Intelligence Research (JAIR), 17:309--332, 2002."},{"key":"e_1_3_2_1_8_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_9_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_10_1","first-page":"24","volume-title":"Proc. of the Int. Conf. on Genetic Algorithms (ICGA-95)","author":"Harik G. R.","year":"1995","unstructured":"G. R. Harik . Finding multimodal solutions using restricted tournament selection . Proc. of the Int. Conf. on Genetic Algorithms (ICGA-95) , pages 24 -- 31 , 1995 . G. R. Harik. Finding multimodal solutions using restricted tournament selection. Proc. of the Int. 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.1997.592259"},{"key":"e_1_3_2_1_13_1","first-page":"184","volume-title":"Proc. of the Int. Conf. on Genetic Algorithms (ICGA-95)","author":"Jones T.","year":"1995","unstructured":"T. Jones and S. Forrest . Fitness distance correlation as a measure of problem difficulty for genetic algorithms . Proc. of the Int. Conf. on Genetic Algorithms (ICGA-95) , pages 184 -- 192 , 1995 . T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. Proc. of the Int. Conf. on Genetic Algorithms (ICGA-95), pages 184--192, 1995."},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in the Sciences of Complexity","first-page":"527","volume-title":"Adaptation on rugged fitness landscapes","author":"Kauffman S.","year":"1989","unstructured":"S. Kauffman . Adaptation on rugged fitness landscapes . In D. L. Stein, editor, Lecture Notes in the Sciences of Complexity , pages 527 -- 618 . Addison Wesley , 1989 . S. Kauffman. Adaptation on rugged fitness landscapes. In D. L. Stein, editor, Lecture Notes in the Sciences of Complexity, pages 527--618. Addison Wesley, 1989."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195079517.001.0001","volume-title":"The origins of Order: Self-organization and selection in evolution","author":"Kauffman S.","year":"1993","unstructured":"S. Kauffman . The origins of Order: Self-organization and selection in evolution . Oxford University Press , 1993 . S. Kauffman. The origins of Order: Self-organization and selection in evolution. Oxford University Press, 1993."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/1063656041774956"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017912624016"},{"key":"e_1_3_2_1_18_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 , 2005 . M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, 2005."},{"key":"e_1_3_2_1_19_1","first-page":"511","volume-title":"Genetic and Evolutionary Comp. Conf. (GECCO-2001)","author":"Pelikan M.","year":"2001","unstructured":"M. Pelikan and D. E. Goldberg . Escaping hierarchical traps with competent genetic algorithms . Genetic and Evolutionary Comp. Conf. (GECCO-2001) , pages 511 -- 518 , 2001 . M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. Genetic and Evolutionary Comp. Conf. (GECCO-2001), pages 511--518, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.10103"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24855-2_4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_80"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389287"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570018"},{"key":"e_1_3_2_1_25_1","volume-title":"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":"publisher","DOI":"10.1007\/BF01165154"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569952"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.700085"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202749"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.887236"}],"event":{"name":"GECCO '10: Genetic and Evolutionary Computation Conference","location":"Portland Oregon USA","acronym":"GECCO '10","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"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.1830606","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1830483.1830606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:39Z","timestamp":1750245759000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,7]]},"references-count":28,"alternative-id":["10.1145\/1830483.1830606","10.1145\/1830483"],"URL":"https:\/\/doi.org\/10.1145\/1830483.1830606","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"}}]}}