next up previous
Next: About this document Up: Fitness Causes Bloat Previous: Acknowledgements

References

1
Walter Alden Tackett. Genetic programming for feature discovery and image discrimination. In Stephanie Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, pages 303--309, University of Illinois at Urbana-Champaign, 17-21 July 1993. Morgan Kaufmann.

2
Walter Alden Tackett. Recombination, Selection, and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California, Department of Electrical Engineering Systems, 1994.
ftp://ftp.io.com/pub/genetic-programming/papers/watphd.tar.Z

3
Peter John Angeline. Genetic programming and emergent intelligence. In Kenneth E. Kinnear, Jr., editor, Advances in Genetic Programming, chapter 4, pages 75--98. MIT Press, 1994.
http://www.spectra.net/~angeline/docs/aigp.ps.Z

4
Walter Alden Tackett. Greedy recombination and genetic search on the space of computer programs. In L. Darrell Whitley and Michael D. Vose, editors, Foundations of Genetic Algorithms 3, pages 271--297, Estes Park, Colorado, USA, 31 July--2 August 1994 1995. Morgan Kaufmann.

5
W. B. Langdon. Evolving data structures using genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 295--302, Pittsburgh, PA, USA, 15-19 July 1995. Morgan Kaufmann.
ftp://cs.ucl.ac.uk/genetic/papers/GPdata_icga-95.ps

6
Peter Nordin and Wolfgang Banzhaf. Complexity compression and evolution. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 310--317, Pittsburgh, PA, USA, 15-19 July 1995. Morgan Kaufmann.
ftp://lumpi.informatik.uni-dortmund.de/pub/biocomp/papers/icga95-1.ps.gz

7
Terence Soule, James A. Foster, and John Dickinson. Code growth in genetic programming. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 215--223, Stanford University, CA, USA, 28--31 July 1996. MIT Press.

8
Annie S. Wu and Robert K. Lindsay. A survey of intron research in genetics. In Hans-Michael Voigt, Werner Ebeling, Ingo Rechenberg, and Hans-Paul Schwefel, editors, Parallel Problem Solving From Nature IV. Proceedings of the International Conference on Evolutionary Computation, volume 1141 of LNCS, pages 101--110, Berlin, Germany, 22-26 September 1996. Springer-Verlag.

9
Tobias Blickle and Lothar Thiele. Genetic programming and redundancy. In J. Hopf, editor, Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken), pages 33--38, Im Stadtwald, Building 44, D-66123 Saarbrücken, Germany, 1994. Max-Planck-Institut für Informatik (MPI-I-94-241).
http://www.tik.ee.ethz.ch/~blickle/GPandRedundancy.ps.gz

10
Tobias Blickle. Theory of Evolutionary Algorithms and Application to System Synthesis. PhD thesis, Swiss Federal Institute of Technology, Zurich, November 1996.
http://www.tik.ee.ethz.ch/~blickle/diss.html

11
Peter Nordin, Frank Francone, and Wolfgang Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In Justinian P. Rosca, editor, Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pages 6--22, Tahoe City, California, USA, 9 July 1995.
ftp://lumpi.informatik.uni-dortmund.de/pub/biocomp/papers/ML95.ps.gz

12
Peter Nordin, Frank Francone, and Wolfgang Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In Peter J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 6, pages 111--134. MIT Press, Cambridge, MA, USA, 1996.

13
Nicholas Freitag McPhee and Justin Darwin Miller. Accurate replication in genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 303--309, Pittsburgh, PA, USA, 15-19 July 1995. Morgan Kaufmann.

14
Justinian P. Rosca and Dana H. Ballard. Complexity drift in evolutionary computation with tree representations. Technical Report NRL5, University of Rochester, Computer Science Department, Rochester, NY, USA, December 1996.

15
W. B. Langdon. Data Structures and Genetic Programming. PhD thesis, University College, London, 27 September 1996.
ftp://ftp.cs.bham.ac.uk/pub/authors/W.B.Langdon/papers/langdon.ps.gz

16
John R. Koza. Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge, MA, USA, 1992.

17
John R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts, May 1994.

18
George R. Price. Selection and covariance. Nature, 227, August 1:520--521, 1970.

19
W. B. Langdon and R. Poli. An analysis of the MAX problem in genetic programming. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
ftp://ftp.cs.bham.ac.uk/pub/authors/W.B.Langdon/papers/WBL.max_gp97.ps

20
Lee Altenberg. The Schema Theorem and Price's Theorem. In L. Darrell Whitley and Michael D. Vose, editors, Foundations of Genetic Algorithms 3, pages 23--49, Estes Park, Colorado, USA, 31 July--2 August 1994 1995. Morgan Kaufmann.
ftp://ftp.mhpcc.edu/pub/incoming/altenberg/LeeSTPT.ps.Z

21
Justinian P. Rosca and Dana H. Ballard. Discovery of subroutines in genetic programming. In Peter J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 9, pages 177--202. MIT Press, Cambridge, MA, USA, 1996.
ftp://ftp.cs.rochester.edu/pub/u/rosca/gp/96.aigp2.dsgp.ps.gz

22
Chris Gathercole and Peter Ross. Dynamic training subset selection for supervised learning in genetic programming. In Yuval Davidor, Hans-Paul Schwefel, and Reinhard Männer, editors, Parallel Problem Solving from Nature III, pages 312--321, Jerusalem, 9-14 October 1994. Springer-Verlag.

23
Chris Gathercole and Peter Ross. An adverse interaction between crossover and restricted tree depth in genetic programming. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 291--296, Stanford University, CA, USA, 28--31 July 1996. MIT Press.
ftp://ftp.dai.ed.ac.uk/pub/user/chrisg/chrisg_max-problem- in-GP_camera-ready-version.for-GP-96.ps.gz

24
W. B. Langdon and R. Poli. Price's theorem and the MAX problem. Technical Report CSRP-97-4, University of Birmingham, School of Computer Science, January 1997.
ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1997/CSRP-97-04.ps.gz

25
Byoung-Tak Zhang and Heinz Mühlenbein. Evolving optimal neural networks using genetic algorithms with Occam's razor. Complex Systems, 7:199--220, 1993.
ftp://borneo.gmd.de/pub/as/ga/gmd_as_ga-93_05.ps

26
Hitoshi Iba, Hugo de Garis, and Taisuke Sato. Genetic programming using a minimum description length principle. In Kenneth E. Kinnear, Jr., editor, Advances in Genetic Programming, chapter 12, pages 265--284. MIT Press, 1994.

27
William B. Langdon. Data structures and genetic programming. In Peter J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 20, pages 395--414. MIT Press, Cambridge, MA, USA, 1996.
ftp://cs.ucl.ac.uk/genetic/papers/WBL.aigp2.ch20.ps

28
K. Sims. Interactive evolution of equations for procedural models. The Visual Computer, 9:466--476, 1993.



William B Langdon
Tue Jun 10 12:12:55 BST 1997