{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:49Z","timestamp":1750307509190,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"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":[[2009,7,8]]},"DOI":"10.1145\/1569901.1570211","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T13:32:17Z","timestamp":1248183137000},"page":"1875-1876","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Cooperative and decomposable approaches on royal road functions"],"prefix":"10.1145","author":[{"given":"Gustavo","family":"Reis","sequence":"first","affiliation":[{"name":"School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal"}]},{"given":"Francisco","family":"Fernand\u00e9z","sequence":"additional","affiliation":[{"name":"University of Extremandura, Merida, Spain"}]},{"given":"Gustavo","family":"Olague","sequence":"additional","affiliation":[{"name":"Applied Physics Division, Cicese, Mexico, Mexico"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010065123132"},{"key":"e_1_3_2_1_2_1","first-page":"109","volume-title":"Foundations of Genetic Algorithms 2","author":"Forrest S.","year":"1993","unstructured":"S. Forrest and M. Mitchell . Relative building-block fitness and he building-block hypothesis . In Foundations of Genetic Algorithms 2 , pages 109 -- 126 . Morgan Kaufmann , 1993 . S. Forrest and M. Mitchell. Relative building-block fitness and he building-block hypothesis. In Foundations of Genetic Algorithms 2, pages 109--126. Morgan Kaufmann, 1993."},{"key":"e_1_3_2_1_3_1","first-page":"245","volume-title":"Proceedings of the First European Conference on Artificial Life","author":"Mitchell M.","year":"1992","unstructured":"M. Mitchell , S. Forrest , and J. H. Holland . The royal road for genetic algorithms: Fitness landscapes and ga performance . In Proceedings of the First European Conference on Artificial Life , pages 245 -- 254 . MIT Press , 1992 . M. Mitchell, S. Forrest, and J. H. Holland. The royal road for genetic algorithms: Fitness landscapes and ga performance. In Proceedings of the First European Conference on Artificial Life, pages 245--254. MIT Press, 1992."},{"key":"e_1_3_2_1_4_1","first-page":"184","volume-title":"Artificial Evolution","author":"Ochoa G.","year":"2007","unstructured":"G. Ochoa , E. Lutton , and E. K. Burke . The cooperative royal road: Avoiding hitchhiking . In Artificial Evolution , pages 184 -- 195 , 2007 . G. Ochoa, E. Lutton, and E. K. Burke. The cooperative royal road: Avoiding hitchhiking. In Artificial Evolution, pages 184--195, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1787943.1787978"}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1570211","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1569901.1570211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:59Z","timestamp":1750249079000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1570211"}},"subtitle":["overcoming the random mutation hill-climber"],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":5,"alternative-id":["10.1145\/1569901.1570211","10.1145\/1569901"],"URL":"https:\/\/doi.org\/10.1145\/1569901.1570211","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}