{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:07:21Z","timestamp":1770995241741,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":2,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T00:00:00Z","timestamp":1152316800000},"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":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144166","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"953-954","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Genetic programming"],"prefix":"10.1145","author":[{"given":"Alan","family":"Piszcz","sequence":"first","affiliation":[{"name":"University of Idaho, Moscow, ID"}]},{"given":"Terence","family":"Soule","sequence":"additional","affiliation":[{"name":"University of Idaho, Moscow, ID"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"982","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"Daida J. M.","year":"1999","unstructured":"J. M. Daida , J. A. Polito , S. A. Stanhope , R. R. Bertram , J. C. Khoo , and S. A. Chaudhary . What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming . 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 , volume 2 , pages 982 -- 989 , Orlando, Florida, USA , 13-17 July 1999 . Morgan Kaufmann . J. M. Daida, J. A. Polito, S. A. Stanhope, R. R. Bertram, J. C. Khoo, and S. A. Chaudhary. What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming. 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, volume 2, pages 982--989, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann."},{"issue":"3","key":"e_1_3_2_1_2_1","first-page":"76","article-title":"Human-competitive machine intelligence by means of genetic programming","volume":"15","author":"Koza J. R.","year":"2000","unstructured":"J. R. Koza . Human-competitive machine intelligence by means of genetic programming . IEEE Intelligent Systems , 15 ( 3 ): 76 -- 78 , May-June 2000 . J. R. Koza. Human-competitive machine intelligence by means of genetic programming. IEEE Intelligent Systems, 15(3):76--78, May-June 2000.","journal-title":"IEEE Intelligent Systems"}],"event":{"name":"GECCO06: Genetic and Evolutionary Computation Conference","location":"Seattle Washington USA","acronym":"GECCO06","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144166","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:15Z","timestamp":1750259655000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144166"}},"subtitle":["optimal population sizes for varying complexity problems"],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":2,"alternative-id":["10.1145\/1143997.1144166","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144166","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}