{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:42Z","timestamp":1750308102402,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,25]],"date-time":"2005-06-25T00:00:00Z","timestamp":1119657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,25]]},"DOI":"10.1145\/1068009.1068295","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"1713-1720","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Probing for limits to building block mixing with a tunably-difficult problem for genetic programming"],"prefix":"10.1145","author":[{"given":"Jason M.","family":"Daida","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"Michael E.","family":"Samples","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"Matthew J.","family":"Byom","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]}],"member":"320","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Morgan Kaufmann","author":"Banzhaf W.","year":"1998","unstructured":"Banzhaf , W. , : An Introduction . Morgan Kaufmann , San Francisco , 1998 . Banzhaf, W., et al. GP: An Introduction. Morgan Kaufmann, San Francisco, 1998."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1006246"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068284"},{"key":"e_1_3_2_1_4_1","volume-title":"Theory and Practice","author":"Daida J.M.","year":"2003","unstructured":"Daida , J.M. What Makes a Problem GP-Hard? A Look at How Structure Affects Content . in Riolo, R.L. and Worzel, W. eds. GP Theory and Practice , Kluwer Academic Publishers , Dordrecht , 2003 , 99--118. Daida, J.M. What Makes a Problem GP-Hard? A Look at How Structure Affects Content. in Riolo, R.L. and Worzel, W. eds. GP Theory and Practice, Kluwer Academic Publishers, Dordrecht, 2003, 99--118."},{"key":"e_1_3_2_1_5_1","volume-title":"Advances in GP 3","author":"Daida J.M.","year":"1999","unstructured":"Daida , J.M. , Bertram , R.B. , Polito 2, J.A. and Stanhope , S.A . Analysis of Single-Node (Building) Blocks in GP . in Spector, L., et al. eds. Advances in GP 3 , MIT Press , Cambridge , 1999 , 217--241. Daida, J.M., Bertram, R.B., Polito 2, J.A. and Stanhope, S.A. Analysis of Single-Node (Building) Blocks in GP. in Spector, L., et al. eds. Advances in GP 3, MIT Press, Cambridge, 1999, 217--241."},{"key":"e_1_3_2_1_6_1","volume-title":"GECCO 2003","author":"Daida J.M.","year":"2003","unstructured":"Daida , J.M. and Hilss , A.M . Identifying Structural Mechanisms in Standard GP. in Cant\u00fa-Paz, et al. eds . GECCO 2003 , Springer-Verlag, Berlin , 2003 , 1639--1651. Daida, J.M. and Hilss, A.M. Identifying Structural Mechanisms in Standard GP. in Cant\u00fa-Paz, et al. eds. GECCO 2003, Springer-Verlag, Berlin, 2003, 1639--1651."},{"key":"e_1_3_2_1_7_1","volume-title":"GECCO 2003","author":"Daida J.M.","year":"2003","unstructured":"Daida , J.M. , What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes. in Cant\u00fa-Paz, et al. eds . GECCO 2003 , Springer-Verlag, Berlin , 2003 , 1665--1677. Daida, J.M., et al. What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes. in Cant\u00fa-Paz, et al. eds. GECCO 2003, Springer-Verlag, Berlin, 2003, 1665--1677."},{"key":"e_1_3_2_1_8_1","volume-title":"GECCO '99","author":"Daida J.M.","year":"1999","unstructured":"Daida , J.M. , What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in GP . in Banzhaf, W., et al. eds. GECCO '99 , Morgan Kaufmann , San Francisco , 1999 , 982 -- 989. Daida, J.M., et al. What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in GP. in Banzhaf, W., et al. eds. GECCO '99, Morgan Kaufmann, San Francisco, 1999, 982 -- 989."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011504414730"},{"key":"e_1_3_2_1_10_1","volume-title":"GP","author":"Gathercole C.","year":"1996","unstructured":"Gathercole , C. and Ross , P . An Adverse Interaction Between Crossover and Restricted Tree Depth in GP . in Koza, J.R., et al. eds. GP 1996 , MIT Press , Cambridge , 1996, 291--296. Gathercole, C. and Ross, P. An Adverse Interaction Between Crossover and Restricted Tree Depth in GP. in Koza, J.R., et al. eds. GP 1996, MIT Press, Cambridge, 1996, 291--296."},{"key":"e_1_3_2_1_11_1","volume-title":"EuroGP","author":"Goldberg D.E.","year":"1998","unstructured":"Goldberg , D.E. and O'Reilly , U.-M. Where Does the Good Stuff Go, and Why? in Banzhaf , W., et al. eds. EuroGP , Springer-Verlag , Berlin , 1998 , 16--36. Goldberg, D.E. and O'Reilly, U.-M. Where Does the Good Stuff Go, and Why? in Banzhaf, W., et al. eds. EuroGP, Springer-Verlag, Berlin, 1998, 16--36."},{"key":"e_1_3_2_1_12_1","volume-title":"U.-M., et al. eds. GP Theory and Practice II","author":"Hall J.M.","year":"2004","unstructured":"Hall , J.M. and Soule , T . Does GP Inherently Adopt Structured Design Techniques? in O'Reilly , U.-M., et al. eds. GP Theory and Practice II , Kluwer Academic Publishers , Boston , 2004 . Hall, J.M. and Soule, T. Does GP Inherently Adopt Structured Design Techniques? in O'Reilly, U.-M., et al. eds. GP Theory and Practice II, Kluwer Academic Publishers, Boston, 2004."},{"key":"e_1_3_2_1_13_1","volume-title":"GP","author":"Langdon W.B.","year":"1997","unstructured":"Langdon , W.B. and Poli , R . An Analysis of the MAX Problem in Genetic Programming . in Koza, J.R., et al. eds. GP 1997 , Morgan Kaufmann , San Francisco , 1997, 222--230. Langdon, W.B. and Poli, R. An Analysis of the MAX Problem in Genetic Programming. in Koza, J.R., et al. eds. GP 1997, Morgan Kaufmann, San Francisco, 1997, 222--230."},{"key":"e_1_3_2_1_14_1","volume-title":"Foundations of GP","author":"Langdon W.B.","year":"2002","unstructured":"Langdon , W.B. and Poli , R . Foundations of GP . Springer-Verlag , Berlin , 2002 . Langdon, W.B. and Poli, R. Foundations of GP. Springer-Verlag, Berlin, 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"e_1_3_2_1_16_1","volume-title":"GECCO '99","author":"McPhee N.F.","year":"1999","unstructured":"McPhee , N.F. and Hopper , N.J . Analysis of Genetic Diversity through Population History . in Banzhaf, W., et al. eds. GECCO '99 , Morgan Kaufmann , San Francisco , 1999 , 1112 -- 1120. McPhee, N.F. and Hopper, N.J. Analysis of Genetic Diversity through Population History. in Banzhaf, W., et al. eds. GECCO '99, Morgan Kaufmann, San Francisco, 1999, 1112 -- 1120."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760972776"},{"key":"e_1_3_2_1_18_1","volume-title":"The Impact of External Dependency in GP Primitives. in CEC 1999","author":"O'Reilly U.-M.","year":"1998","unstructured":"O'Reilly , U.-M. The Impact of External Dependency in GP Primitives. in CEC 1999 , IEEE Press, Piscataway , 1998 , 306--311. O'Reilly, U.-M. The Impact of External Dependency in GP Primitives. in CEC 1999, IEEE Press, Piscataway, 1998, 306--311."},{"key":"e_1_3_2_1_19_1","volume-title":"GP","author":"O'Reilly U.-M.","year":"1998","unstructured":"O'Reilly , U.-M. and Goldberg , D.E . How Fitness Structure Affects Subsolution Acquisition in GP . in Koza, J.R., et al. eds. GP 1998 , Morgan Kaufmann , San Francisco , 1998, 269--277. O'Reilly, U.-M. and Goldberg, D.E. How Fitness Structure Affects Subsolution Acquisition in GP. in Koza, J.R., et al. eds. GP 1998, Morgan Kaufmann, San Francisco, 1998, 269--277."},{"key":"e_1_3_2_1_20_1","volume-title":"EuroGP","author":"Poli R.","year":"2001","unstructured":"Poli , R. General Schema Theory for GP with Subtree-Swapping Crossover . in Miller, J.F., et al. eds. EuroGP 2001 , Springer-Verlag , Berlin , 2001, 143--159. Poli, R. General Schema Theory for GP with Subtree-Swapping Crossover. in Miller, J.F., et al. eds. EuroGP 2001, Springer-Verlag, Berlin, 2001, 143--159."},{"key":"e_1_3_2_1_21_1","first-page":"316","article-title":"The Royal Tree Problem, A Benchmark for Single and Multiple Population GP. in Angeline, P.J. and K.E. Kinnear, J. eds. Advances in GP, MIT Press","volume":"299","author":"Punch W.","year":"1996","unstructured":"Punch , W. , The Royal Tree Problem, A Benchmark for Single and Multiple Population GP. in Angeline, P.J. and K.E. Kinnear, J. eds. Advances in GP, MIT Press , Cambridge , 1996 , 299 -- 316 . Punch, W., et al. The Royal Tree Problem, A Benchmark for Single and Multiple Population GP. in Angeline, P.J. and K.E. Kinnear, J. eds. Advances in GP, MIT Press, Cambridge, 1996, 299--316.","journal-title":"Cambridge"},{"key":"e_1_3_2_1_22_1","volume-title":"GP","author":"Rosca J.P.","year":"1997","unstructured":"Rosca , J.P. Analysis of Complexity Drift in GP . in Koza, J.R., et al. eds. GP 1997 , Morgan Kaufmann , San Francisco , 1997, 286--294. Rosca, J.P. Analysis of Complexity Drift in GP. in Koza, J.R., et al. eds. GP 1997, Morgan Kaufmann, San Francisco, 1997, 286--294."},{"key":"e_1_3_2_1_23_1","volume-title":"O'Reilly, U.-M., et al. eds. GP Theory and Practice II","author":"Sastry K.","year":"2004","unstructured":"Sastry , K. , Population Sizing for GP Based on Decision Making . in O'Reilly, U.-M., et al. eds. GP Theory and Practice II , Kluwer Academic , Boston , 2004 , 49--65. Sastry, K., et al. Population Sizing for GP Based on Decision Making. in O'Reilly, U.-M., et al. eds. GP Theory and Practice II, Kluwer Academic, Boston, 2004, 49--65."},{"key":"e_1_3_2_1_24_1","volume-title":"GP","author":"Soule T.","year":"1996","unstructured":"Soule , T. , Code Growth in Genetic Programming . in Koza, J.R., et al. eds. GP 1996 , MIT Press , Cambridge , 1996, 215 -- 223. Soule, T., et al. Code Growth in Genetic Programming. in Koza, J.R., et al. eds. GP 1996, MIT Press, Cambridge, 1996, 215 -- 223."},{"key":"e_1_3_2_1_25_1","volume-title":"lilgp","author":"Zongker D.","year":"1995","unstructured":"Zongker , D. and Punch , W . lilgp , Michigan State University Genetic Algorithms Research and Applications Group , Lansing , 1995 . Zongker, D. and Punch, W. lilgp, Michigan State University Genetic Algorithms Research and Applications Group, Lansing, 1995."}],"event":{"name":"GECCO05: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Washington DC USA","acronym":"GECCO05"},"container-title":["Proceedings of the 7th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068295","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1068009.1068295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:03Z","timestamp":1750262883000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,25]]},"references-count":25,"alternative-id":["10.1145\/1068009.1068295","10.1145\/1068009"],"URL":"https:\/\/doi.org\/10.1145\/1068009.1068295","relation":{},"subject":[],"published":{"date-parts":[[2005,6,25]]},"assertion":[{"value":"2005-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}