{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:45:50Z","timestamp":1725565550832},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223436"},{"type":"electronic","value":"9783540248552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24855-2_69","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T08:20:59Z","timestamp":1284452459000},"page":"605-616","source":"Crossref","is-referenced-by-count":2,"title":["Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion\/Deletion Operators"],"prefix":"10.1007","author":[{"given":"Nguyen Xuan","family":"Hoai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. I.","family":"McKay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0055923","volume-title":"Genetic Programming: An Introduction","author":"W. Banzhaf","year":"1998","unstructured":"Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction. Morgan Kaufmann Pub, San Francisco (1998)"},{"key":"69_CR2","first-page":"64","volume-title":"Genetic Programming 1997: Proceedings of the Second Annual Conference","author":"J.M. Daida","year":"1997","unstructured":"Daida, J.M., Ross, S.J., McClain, J.J., Ampy, D.S., Holczer, M.: Challenges with Verification, Repeatability, and Meaningful Comparisons in Genetic Programming. In: Koza, J., et al. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 64\u201369. Morgan Kaufmann, San Francisco (1997)"},{"key":"69_CR3","first-page":"217","volume-title":"Advances in Genetic Programming 3","author":"J.M. Daida","year":"1999","unstructured":"Daida, J.M., Bertram, J.A., Polito, J.A., Stanhope, S.A.: Analysis of Single-Node (Building) Blocks in Genetic Programming. In: Spector, L., Langdon, W.B., O\u2019Reilly, Angeline, P.J. (eds.) Advances in Genetic Programming 3, pp. 217\u2013241. The MIT Press, Cambridge (1999)"},{"key":"69_CR4","first-page":"395","volume-title":"Proceedings of GECCO 2000","author":"O.A. Chaudri","year":"2000","unstructured":"Chaudri, O.A., et al.: Characterizing a Tunably Difficult Problem in Genetic Programming. In: Witley, L.D., et al. (eds.) Proceedings of GECCO 2000, pp. 395\u2013402. Morgan Kaufmann Publisher, San Francisco (2000)"},{"key":"69_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1011504414730","volume":"2","author":"J.M. Daida","year":"2001","unstructured":"Daida, J.M., Polito, J.A., Stanhope, S.A., Bertram, R.R., Khoo, J.C., Chaudhary, S.A., Chaudhri, O.: What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. Journal of Genetic Programming and Evolvable Machines\u00a02, 165\u2013191 (2001)","journal-title":"Journal of Genetic Programming and Evolvable Machines"},{"key":"69_CR6","first-page":"273","volume-title":"Proceedings of the 2002 Congress on Evolutionary Computation","author":"J.M. Daida","year":"2002","unstructured":"Daida, J.M.: Limit to Expression in Genetic Programming: Lattice-Aggregate Modeling. In: Proceedings of the 2002 Congress on Evolutionary Computation, pp. 273\u2013278. IEEE Press, Los Alamitos (2002)"},{"key":"69_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1007\/3-540-45110-2_58","volume-title":"Proceedings of GECCO 2003","author":"J.M. Daida","year":"2003","unstructured":"Daida, J.M., Hilss, A.M.: Identifying Structural Mechanism in Standard GP. In: Proceedings of GECCO 2003. LNCS, pp. 1639\u20131651. Springer, Heidelberg (2003)"},{"key":"69_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1665","DOI":"10.1007\/3-540-45110-2_60","volume-title":"Proceedings of GECCO 2003","author":"J.M. Daida","year":"2003","unstructured":"Daida, J.M., Li, H., Tang, R., Hilss, A.M.: What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes. In: Proceedings of GECCO 2003. LNCS, pp. 1665\u20131677. Springer, Heidelberg (2003)"},{"key":"69_CR9","first-page":"377","volume-title":"Advances in Genetic Programming II","author":"F. Gruau","year":"1996","unstructured":"Gruau, F.: On Using Syntactic Constraints with Genetic Programming. In: Advances in Genetic Programming II, pp. 377\u2013394. The MIT Press, Cambridge (1996)"},{"key":"69_CR10","volume-title":"Fuzzy Rule-Based Expert Systems and Genetic Machine Learning","author":"A. Geyer-Schulz","year":"1995","unstructured":"Geyer-Schulz, A.: Fuzzy Rule-Based Expert Systems and Genetic Machine Learning. Physica-Verlag, Germany (1995)"},{"issue":"1","key":"69_CR11","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":"69_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-59126-6_2","volume-title":"Handbook of Formal Languages","author":"A.K. Joshi","year":"1997","unstructured":"Joshi, A.K., Schabes, Y.: Tree Adjoining Grammars. In: Rozenberg, G., Saloma, A. (eds.) Handbook of Formal Languages, pp. 69\u2013123. Springer, Heidelberg (1997)"},{"key":"69_CR13","volume-title":"Genetic Programming","author":"J. Koza","year":"1992","unstructured":"Koza, J.: Genetic Programming. The MIT Press, Cambridge (1992)"},{"key":"69_CR14","unstructured":"Hoai, N.X., McKay, R.I.: A Framework for Tree Adjunct Grammar Guided Genetic Programming. In: Abbass, H.A., Barlow, M. (eds.) Proceedings of Post Graduate ADFA Conference on Computer Science (PACCS 2001), pp. 93\u201399 (2001)"},{"key":"69_CR15","doi-asserted-by":"crossref","unstructured":"Hoai, N.X., McKay, R.I., Essam, D., Chau, R.: Solving the Symbolic Regression Problem with Tree Adjunct Grammar Guided Genetic Programming: The Comparative Result. In: Proceedings of Congress on Evolutionary Computation (CEC\u20192002), pp. 1326\u20131331 (2002)","DOI":"10.1109\/CEC.2002.1004435"},{"key":"69_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-36599-0_31","volume-title":"Genetic Programming","author":"N.X. Hoai","year":"2003","unstructured":"Hoai, N.X., McKay, R.I., Abbass, H.A.: Tree Adjoining Grammars, Language Bias, and Genetic Programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol.\u00a02610, pp. 335\u2013344. Springer, Heidelberg (2003)"},{"key":"69_CR17","unstructured":"Hoai, N.X., McKay, R.I.: An Investigation on the Roles of Insertion and Deletion Operators in Tree Adjoining Grammar Guided Genetic Programming. To appear in The Proceedings of Congress on Evolutionary Computation, CEC 2004 (2004)"},{"issue":"4","key":"69_CR18","first-page":"349","volume":"4","author":"M. O\u2019Neil","year":"2000","unstructured":"O\u2019Neil, M., Ryan, C.: Grammatical Evolution. IEEE Trans on Evolutionary Computation\u00a04(4), 349\u2013357 (2000)","journal-title":"IEEE Trans on Evolutionary Computation"},{"issue":"1","key":"69_CR19","first-page":"91","volume":"20","author":"Y. Schabes","year":"1994","unstructured":"Schabes, Y., Shieber, S.: An Alternative Conception of Tree-Adjoining Derivation. Computational Linguistics\u00a020(1), 91\u2013124 (1994)","journal-title":"Computational Linguistics"},{"issue":"4","key":"69_CR20","first-page":"479","volume":"21","author":"Y. Schabes","year":"1995","unstructured":"Schabes, Y., Waters, R.C.: Tree Insertion Grammar: A Cubic-Time Parsable Formalism that Lexicalizes Context-Free Grammar without Changing the Trees Produced. Computational Linguistics\u00a021(4), 479\u2013514 (1995)","journal-title":"Computational Linguistics"},{"key":"69_CR21","unstructured":"Schabes, Y.: Mathemantical and Computational Aspects of Lexicalized Grammars, Ph.D. Thesis, University of Pennsylvania, USA (1990)"},{"key":"69_CR22","volume-title":"An Introduction to the Analysis of Algorithms","author":"R. Sedgewick","year":"1996","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading (1996)"},{"key":"69_CR23","unstructured":"Shanker, V.: A Study of Tree Adjoining Grammars. PhD. Thesis, University of Pennsylvania, USA (1987)"},{"key":"69_CR24","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":"69_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/CEC.2003.1299587","volume-title":"Proceedings of Congress on Evolutionary Computation (CEC\u20192003)","author":"L. Vanneschi","year":"2003","unstructured":"Vanneschi, L., Tomassini, M., Collard, P., Clergue, M.: Fitness Distance Correlation in Genetic Programming: a Constructive Counterexample. In: Proceedings of Congress on Evolutionary Computation (CEC\u20192003), pp. 289\u2013296. IEEE Press, Los Alamitos (2003)"},{"key":"69_CR26","unstructured":"Weir, D.J.: Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD. Thesis, University of Pennsylvania, USA, (1988)"},{"key":"69_CR27","unstructured":"Whigham, P.A.: Grammatical Bias for Evolutionary Learning. Ph.D Thesis, University of New South Wales, Australia (1996)"},{"key":"69_CR28","first-page":"33","volume-title":"Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications","author":"P.A. Whigham","year":"1995","unstructured":"Whigham, P.A.: Grammatically-based Genetic Programming. In: Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pp. 33\u201341. Morgan Kaufmann Pub., San Francisco (1995)"},{"key":"69_CR29","first-page":"230","volume-title":"Genetic Programming 1996","author":"P.A. Whigham","year":"1996","unstructured":"Whigham, P.A.: Search Bias, Language Bias and Genetic Programming. In: Genetic Programming 1996, pp. 230\u2013237. The MIT Press, USA (1996)"},{"key":"69_CR30","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1162\/evco.1997.5.2.143","volume":"5","author":"M.L. Wong","year":"1997","unstructured":"Wong, M.L., Leung, K.S.: Evolutionary Program Induction Directed by Logic Grammars. Evolutionary Computation\u00a05, 143\u2013180 (1997)","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2013 GECCO 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24855-2_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:16:19Z","timestamp":1620011779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24855-2_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223436","9783540248552"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24855-2_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}