{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:28:29Z","timestamp":1764782909987},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290414"},{"type":"electronic","value":"9783540317333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558590_7","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T08:53:11Z","timestamp":1128502391000},"page":"66-77","source":"Crossref","is-referenced-by-count":4,"title":["A Survey of Problem Difficulty in Genetic Programming"],"prefix":"10.1007","author":[{"given":"Leonardo","family":"Vanneschi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Tomassini","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Collard","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Clergue","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","first-page":"47","volume-title":"Advances in Genetic Programming","author":"L. Altenberg","year":"1994","unstructured":"Altenberg, L.: The evolution of evolvability in genetic programming. In: Kinnear, K. (ed.) Advances in Genetic Programming, pp. 47\u201374. MIT Press, Cambridge (1994)"},{"key":"7_CR2","unstructured":"Clergue, M., Collard, P., Tomassini, M., Vanneschi, L.: Fitness distance correlation and problem difficulty for genetic programming. In: Langdon, W.B., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2002, New York City, USA, pp. 724\u2013732. Morgan Kaufmann, San Francisco (2002), (Best Conference Paper Award Nomination)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1011504414730","volume":"2","author":"J.M. Daida","year":"2001","unstructured":"Daida, J.M., Bertram, R., Stanhope, S., Khoo, J., Chaudhary, S., Chaudhary, O.: What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming. Genetic Programming and Evolvable Machines\u00a02, 165\u2013191 (2001)","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45984-7_16","volume-title":"Genetic Programming","author":"A. Ek\u00e1rt","year":"2002","unstructured":"Ek\u00e1rt, A., N\u00e9meth, S.Z.: Maintaining the diversity of genetic programs. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol.\u00a02278, pp. 162\u2013171. Springer, Heidelberg (2002)"},{"key":"7_CR5","unstructured":"Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque (1995)"},{"key":"7_CR6","volume-title":"Genetic Programming","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming. The MIT Press, Cambridge (1992)"},{"key":"7_CR7","first-page":"222","volume-title":"Genetic Programming 1997: Proceedings of the Second Annual Conference on Genetic Programming","author":"W.B. Langdon","year":"1997","unstructured":"Langdon, W.B., Poli, R.: An analysis of the max problem in genetic programming. In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Iba, H., Riolo, R.L. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference on Genetic Programming, pp. 222\u2013230. Morgan Kaufmann, San Francisco (1997)"},{"key":"7_CR8","volume-title":"Lectures on Monte Carlo Methods","author":"N. Madras","year":"2002","unstructured":"Madras, N.: Lectures on Monte Carlo Methods. American Mathematical Society, Providence (2002)"},{"key":"7_CR9","first-page":"299","volume-title":"Advances in Genetic Programming 2","author":"B. Punch","year":"1996","unstructured":"Punch, B., Zongker, D., Goodman, E.: The royal tree problem, a benchmark for single and multiple population genetic programming. In: Angeline, P., Kinnear, K. (eds.) Advances in Genetic Programming 2, pp. 299\u2013316. MIT Press, Cambridge (1996)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0056851","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"R.J. Quick","year":"1998","unstructured":"Quick, R.J., Rayward-Smith, V.J., Smith, G.D.: Fitness distance correlation and ridge functions. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 77\u201386. Springer, Heidelberg (1998)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Tomassini, M., Vanneschi, L., Collard, P., Clergue, M.: A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation (2004) (to appear)","DOI":"10.1007\/3-540-36599-0_43"},{"key":"7_CR12","unstructured":"Vanneschi, L.: Theory and Practice for Efficient Genetic Programming. Ph.D. thesis, Faculty of Science, University of Lausanne, Switzerland, Honored with the Excellence Award by the Science Faculty of the University of Lausanne (2004), Downlodable version at, http:\/\/www.disco.unimib.it\/vanneschi"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Vanneschi, L., Tomassini, M., Clergue, M., Collard, P.: Difficulty of unimodal and multimodal landscapes in genetic programming. In: Cant\u00fa-Paz, E., et al. (eds.), GECCO 2003. LNCS; vol .2724, pp. 1788\u20131799. Springer, Heidelberg (2003), Best Conference Paper Award Nomination","DOI":"10.1007\/3-540-45110-2_70"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/CEC.2003.1299587","volume-title":"Congress on Evolutionary Computation (CEC 2003)","author":"L. Vanneschi","year":"2003","unstructured":"Vanneschi, L., Tomassini, M., Collard, P., Clergue, M.: Fitness distance correlation in genetic programming: a constructive counterexample. In: Congress on Evolutionary Computation (CEC 2003), Canberra, Australia, pp. 289\u2013296. IEEE Computer Society Press, Piscataway (2003)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/3-540-36599-0_43","volume-title":"Genetic Programming","author":"L. Vanneschi","year":"2003","unstructured":"Vanneschi, L., Tomassini, M., Collard, P., Clergue, M.: Fitness distance correlation in structural mutation genetic programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol.\u00a02610, pp. 455\u2013464. Springer, Heidelberg (2003)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1109\/CEC.2003.1299585","volume-title":"CEC 2003: IEEE International Congress on Evolutionary Computation","author":"S. V\u00e9rel","year":"2003","unstructured":"V\u00e9rel, S., Collard, P., Clergue, M.: Where are bottleneck in nk-fitness landscapes? In: CEC 2003: IEEE International Congress on Evolutionary Computation, Canberra, Australia, pp. 273\u2013280. IEEE Press, Piscataway (2003)"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2005: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558590_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:48:54Z","timestamp":1605624534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558590_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290414","9783540317333"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11558590_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}