Probing for limits to building block mixing with a tunably-difficult problem for genetic programming

Jason M. Daida, Michael E. Samples, Matthew J. Byom. Probing for limits to building block mixing with a tunably-difficult problem for genetic programming. In Hans-Georg Beyer, Una-May O Reilly, editors, Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005. pages 1713-1720, ACM, 2005. [doi]

@inproceedings{DaidaSB05,
  title = {Probing for limits to building block mixing with a tunably-difficult problem for genetic programming},
  author = {Jason M. Daida and Michael E. Samples and Matthew J. Byom},
  year = {2005},
  doi = {10.1145/1068009.1068295},
  url = {http://doi.acm.org/10.1145/1068009.1068295},
  tags = {e-science, programming, genetic programming},
  researchr = {https://researchr.org/publication/DaidaSB05},
  cites = {0},
  citedby = {0},
  pages = {1713-1720},
  booktitle = {Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005},
  editor = {Hans-Georg Beyer and Una-May O Reilly},
  publisher = {ACM},
  isbn = {1-59593-010-8},
}