{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T04:15:32Z","timestamp":1744085732577,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329364"},{"type":"electronic","value":"9783642329371"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32937-1_39","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T18:49:02Z","timestamp":1345920542000},"page":"387-396","source":"Crossref","is-referenced-by-count":0,"title":["Analysing the Effects of Diverse Operators in a Genetic Programming System"],"prefix":"10.1007","author":[{"given":"MinHyeok","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bob","family":"McKay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangil","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuan Hoai","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1007\/3-540-45110-2_60","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"J. Daida","year":"2003","unstructured":"Daida, J., Li, H., Tang, R., Hilss, A.: What Makes a Problem GP-hard? Validating a Hypothesis of Structural Causes. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1665\u20131677. Springer, Heidelberg (2003)"},{"key":"39_CR2","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.R., Stanhope, S.A., Khoo, J.C., Chaudhary, S.A., Chaudhri, O.A., Polito, J.A.I.: What makes a problem gp-hard? analysis of a tunably difficult problem in genetic programming. Genetic Programming and Evolvable Machines\u00a02, 165\u2013191 (2001), doi:10.1023\/A:1011504414730","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"39_CR3","unstructured":"Ferreira, C.: Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence. Springer (2002)"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0055925","volume-title":"Genetic Programming","author":"D.E. Goldberg","year":"1998","unstructured":"Goldberg, D.E., O\u2019Reilly, U.-M.: Where Does the Good Stuff Go, and Why? How Contextual Semantics Influences Program Structure in Simple Genetic Programming. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol.\u00a01391, pp. 16\u201336. Springer, Heidelberg (1998)"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-31989-4_16","volume-title":"Genetic Programming","author":"S. Gustafson","year":"2005","unstructured":"Gustafson, S., Vanneschi, L.: Operator-Based Distance for Genetic Programming: Subtree Crossover Distance. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol.\u00a03447, pp. 178\u2013189. Springer, Heidelberg (2005)"},{"key":"39_CR6","unstructured":"Hoai, N.: A Flexible Representation for Genetic Programming: Lessons from Natural Language Processing. Ph.D. thesis, University of New South Wales, Australian Defence Force Academy, Australia (2004)"},{"key":"39_CR7","unstructured":"Hoai, N., McKay, R.: A framework for tree adjunct grammar guided genetic programming. In: Proc. Postgraduate Conf. on Computer Science, Canberra, Australia, pp. 93\u201399 (2001)"},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.asoc.2009.05.003","volume":"10","author":"J. Hugosson","year":"2010","unstructured":"Hugosson, J., Hemberg, E., Brabazon, A., O\u2019Neill, M.: Genotype representations in grammatical evolution. Applied Soft Computing\u00a010(1), 36\u201343 (2010)","journal-title":"Applied Soft Computing"},{"issue":"1","key":"39_CR9","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A.K. Joshi","year":"1975","unstructured":"Joshi, A.K., Levy, L.S., Takahashi, M.: Tree adjunct grammars. Journal of Computer and System Sciences\u00a010(1), 136\u2013163 (1975)","journal-title":"Journal of Computer and System Sciences"},{"key":"39_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-29139-5_20","volume-title":"Genetic Programming","author":"M. Kim","year":"2012","unstructured":"Kim, M., McKay, R.I.B., Kim, D.K., Nguyen, X.H.: Evolutionary Operator Self-adaptation with Diverse Operators. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds.) EuroGP 2012. LNCS, vol.\u00a07244, pp. 230\u2013241. Springer, Heidelberg (2012)"},{"key":"39_CR11","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"issue":"1-2","key":"39_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1010024515191","volume":"1","author":"W.B. Langdon","year":"2000","unstructured":"Langdon, W.B.: Size fair and homologous tree crossovers for tree genetic programming. Genetic Programming and Evolvable Machines\u00a01(1-2), 95\u2013119 (2000)","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"39_CR13","unstructured":"Langdon, W., Soule, T., Poli, R., Foster, J.: The evolution of size and shape. In: Advances in Genetic Programming, vol. 3, ch.8, pp. 163\u2013190. The MIT Press, Cambridge (1999)"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1007\/978-3-540-24854-5_131","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"A. Moraglio","year":"2004","unstructured":"Moraglio, A., Poli, R.: Topological Interpretation of Crossover. In: Deb, K., Tari, Z. (eds.) GECCO 2004. LNCS, vol.\u00a03102, pp. 1377\u20131388. Springer, Heidelberg (2004)"},{"key":"39_CR15","first-page":"269","volume":"98","author":"U. O\u2019 Reilly","year":"1998","unstructured":"O\u2019 Reilly, U., Goldberg, D.: How fitness structure affects subsolution acquisition in genetic programming. Genetic Programming\u00a098, 269\u2013277 (1998)","journal-title":"Genetic Programming"},{"issue":"1","key":"39_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1162\/106365603321829005","volume":"11","author":"R. Poli","year":"2003","unstructured":"Poli, R., McPhee, N.: General schema theory for genetic programming with subtree-swapping crossover: Part i. Evolutionary Computation\u00a011(1), 53\u201366 (2003)","journal-title":"Evolutionary Computation"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Tackett, W., Carmi, A.: The unique implications of brood selection for genetic programming. In: World Congress on Computational Intelligence, Orlando, FL, USA, vol.\u00a01, pp. 160\u2013165 (June 1994)","DOI":"10.1109\/ICEC.1994.350023"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Whigham, P.A.: A schema theorem for context-free grammars. In: IEEE Conf. on Evolutionary Computation, vol.\u00a01, pp. 178\u2013181. IEEE Press (November 1995)","DOI":"10.1109\/ICEC.1995.489140"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Whigham, P., et al.: Grammatically-based genetic programming. In: Proc. Workshop on Genetic Programming: From Theory to Real-World Applications, July 9, pp. 33\u201341. Ueniversity of Rochester (1995)","DOI":"10.1049\/cp:19951092"},{"key":"39_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1007\/3-540-45110-2_20","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"M. Wineberg","year":"2003","unstructured":"Wineberg, M., Oppacher, F.: Distance between Populations. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02723, pp. 1481\u20131492. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN XII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32937-1_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T08:41:56Z","timestamp":1744015316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32937-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329364","9783642329371"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32937-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}