{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T05:19:55Z","timestamp":1737695995739,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406037"},{"type":"electronic","value":"9783540451105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45110-2_63","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T14:04:48Z","timestamp":1197295488000},"page":"1702-1714","source":"Crossref","is-referenced-by-count":10,"title":["Convergence of Program Fitness Landscapes"],"prefix":"10.1007","author":[{"given":"W. B.","family":"Langdon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"63_CR1","unstructured":"[Banzhaf et al., 1998]_Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, and Frank D. Francone. Genetic Programming \u2014 An Introduction. Morgan Kaufmann."},{"key":"63_CR2","unstructured":"[Clergue et al., 2002]_Fitness distance correlation and problem difficulty for genetic programming. In GECCO 2002, pp 724\u2013732, New York, 9\u201313 July 2002."},{"issue":"2","key":"63_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1011504414730","volume":"2","author":"D. 2. M. Daida","year":"2001","unstructured":"[Daida et al., 2001]_Jason M. Daida, et al.. What makes a problem GP-hard? Genetic Programming and Evolvable Machines, 2(2):165\u2013191, June 2001.","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"63_CR4","unstructured":"A comparative analysis of selection schemes used in genetic algorithms. In G. J. E. Rawlins, editor, FOGA, pp 69\u201393. Morgan Kaufmann."},{"key":"63_CR5","unstructured":"Terry Jones. One operator, one landscape. Technical Report SFI TR 95-02-025, Santa Fe Institute, January 1995."},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"Kenneth E. Kinnear, Jr. Fitness landscapes and difficulty in genetic programming. In WCCI, pp 142\u2013147, Orlando, 27\u201329 June 1994. IEEE Press.","DOI":"10.1109\/ICEC.1994.350026"},{"key":"63_CR7","doi-asserted-by":"crossref","unstructured":"W. B. Langdon and Riccardo Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.","DOI":"10.1007\/978-3-662-04726-2"},{"key":"63_CR8","unstructured":"Convergence rates for the distribution of program outputs. In GECCO 2002, pp 812\u2013819, New York, 9\u201313 July 2002. Morgan Kaufmann."},{"key":"63_CR9","unstructured":"W. B. Langdon. How many good programs are there? How long are they? In Jonathan Rowe, et al. editors, FOGA VII. Morgan Kaufmann."},{"key":"63_CR10","doi-asserted-by":"crossref","unstructured":"W. B. Langdon. The distribution of reversible functions is Normal. In Rick Riolo, editor, GP Theory and Practise. 2003. Forthcoming.","DOI":"10.1007\/978-1-4419-8983-3_11"},{"key":"63_CR11","doi-asserted-by":"crossref","unstructured":"Predictive models for the breeder genetic algorithm. Evolutionary Computation, 1(1):25\u201349, 1993.","DOI":"10.1162\/evco.1993.1.1.25"},{"key":"63_CR12","unstructured":"Concepts of inductive genetic programming. In W. Banzhaf, et al. editors, EuroGP, LNCS 1391, pp 49\u201360. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2014 GECCO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45110-2_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T13:54:32Z","timestamp":1737640472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45110-2_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406037","9783540451105"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45110-2_63","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}