{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:22:15Z","timestamp":1740028935482,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540263197"},{"type":"electronic","value":"9783540316732"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499305_26","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T05:39:11Z","timestamp":1270791551000},"page":"252-261","source":"Crossref","is-referenced-by-count":7,"title":["Grammar Based Crossover Operator in Genetic Programming"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Manrique","sequence":"first","affiliation":[]},{"given":"Fernando","family":"M\u00e1rquez","sequence":"additional","affiliation":[]},{"given":"Juan","family":"R\u00edos","sequence":"additional","affiliation":[]},{"given":"Alfonso","family":"Rodr\u00edguez-Pat\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Koza, J.R.: Genetically Breeding Populations of Computer Programs to Solve Problems in Artificial Intelligence. Stanford University, Department of Computer Science. CS-TR-90-1314 (1990)"},{"key":"26_CR2","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)"},{"key":"26_CR3","unstructured":"Singleton, A.: Greediness. Posting of 8-21-1993 on genetic-programming@cs.standford.edu mailing list (1993)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1776","DOI":"10.1007\/3-540-45110-2_69","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"S. Silva","year":"2003","unstructured":"Silva, S., Almeida, J.: Dynamic Maximum Tree Depth. A Simple Technique for Avoiding Bloat in Tree-Based GP. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1776\u20131787. Springer, Heidelberg (2003)"},{"key":"26_CR5","first-page":"95","volume-title":"Size Fair and Homologous Tree Crossovers for Tree Genetic Program-ming. Genetic Programming and Evolvable Machines","author":"W.B. Langdon","year":"2000","unstructured":"Langdon, W.B.: Size Fair and Homologous Tree Crossovers for Tree Genetic Program-ming. Genetic Programming and Evolvable Machines, vol.\u00a01, pp. 95\u2013119. Kluwer Academic Publishers, Boston (2000)"},{"key":"26_CR6","unstructured":"Crawford-Marks, R., Spector, L.: Size control via Size Fair Genetic Operators in the PushGP Genetic Programming System. In: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, pp. 733\u2013739 (2002)"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1080\/0020716022000005546","volume":"80","author":"D. Barrios","year":"2003","unstructured":"Barrios, D., Carrascal, A., Manrique, D., R\u00edos, J.: Optimization with Real-Coded Genetic Algorithms Based on Mathematical Morphology. Intern. J. Computer Math.\u00a080(3), 275\u2013293 (2003)","journal-title":"Intern. J. Computer Math."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Whigham, P.A.: Grammatically-Based Genetic Programming. In: Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, California, USA, pp. 33\u201341 (1995)","DOI":"10.1049\/cp:19951092"},{"key":"26_CR9","unstructured":"Hussain, T.S.: Attribute Grammar Encoding of the Structure and Behavior of Artificial Neural Networks. PhD Thesis, Queen\u2019s University. Kingston, Ontario, Canada (2003)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Rodrigues, E., Pozo, A.: Grammar-Guided Genetic Programming and Automatically De-fined Functions. In: Proceedings of the 16th Brazilian Symposium on Artificial Intelligence, Recife, Brazil, pp. 324\u2013333 (2002)","DOI":"10.1007\/3-540-36127-8_31"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"2779","DOI":"10.1016\/j.compchemeng.2004.09.001","volume":"28","author":"B. Grosman","year":"2004","unstructured":"Grosman, B., Lewin, D.R.: Adaptive Genetic Programming for Steady-State Process Mod-eling. Computers and Chemical Engineering\u00a028, 2779\u20132790 (2004)","journal-title":"Computers and Chemical Engineering"},{"key":"26_CR12","unstructured":"Hoai, N.X., McKay, R.I.: Is Ambiguity Useful or Problematic for Grammar Guided Genetic Programming? A case of Study. In: Proceedings of the 4th Asia-Pacific Conference on Simu-lated Evolution and Learning, Singapore, pp. 449\u2013453 (2002)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499305_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T22:15:01Z","timestamp":1740003301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499305_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540263197","9783540316732"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11499305_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}