%0 Conference Paper %1 daida:2004:dctdwatdpfgp %A Daida, Jason M. %A Samples, Michael E. %A Hart, Bryan T. %A Halim, Jeffry %A Kumar, Aditya %B Proceedings of the 2004 IEEE Congress on Evolutionary Computation %C Portland, Oregon %D 2004 %I IEEE Press %K Computation Evolutionary Foundations Theoretical algorithms, genetic of programming, %P 1217--1224 %T Demonstrating Constraints to Diversity with a Tunably Difficulty Problem for Genetic Programming %U http://sitemaker.umich.edu/daida/files/CEC04highlander.pdf %X This paper introduces a tunably difficult problem for genetic programming (GP) that probes for an upper bound to the amount of heterogeneity that can be represented by a single individual. Although GP's variable-length representation would suggest that there is no upper bound, our results indicate otherwise. The results provide insight into the dynamics that occur during the course of a GP run. %@ 0-7803-8515-2

@inproceedings{daida:2004:dctdwatdpfgp, abstract = {This paper introduces a tunably difficult problem for genetic programming (GP) that probes for an upper bound to the amount of heterogeneity that can be represented by a single individual. Although GP's variable-length representation would suggest that there is no upper bound, our results indicate otherwise. The results provide insight into the dynamics that occur during the course of a GP run.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Portland, Oregon}, author = {Daida, Jason M. and Samples, Michael E. and Hart, Bryan T. and Halim, Jeffry and Kumar, Aditya}, biburl = {https://www.bibsonomy.org/bibtex/2257bf5feb5b69d4beff3288563d12a04/brazovayeye}, booktitle = {Proceedings of the 2004 IEEE Congress on Evolutionary Computation}, interhash = {b661a3f03431c8d393df2bec1210f7ce}, intrahash = {257bf5feb5b69d4beff3288563d12a04}, isbn = {0-7803-8515-2}, keywords = {Computation Evolutionary Foundations Theoretical algorithms, genetic of programming,}, month = {20-23 June}, notes = {CEC 2004 - A joint meeting of the IEEE, the EPS, and the IEE.}, pages = {1217--1224}, publisher = {IEEE Press}, size = {8 pages}, timestamp = {2008-06-19T17:38:21.000+0200}, title = {Demonstrating Constraints to Diversity with a Tunably Difficulty Problem for Genetic Programming}, url = {http://sitemaker.umich.edu/daida/files/CEC04highlander.pdf}, year = 2004 }