Structure abstraction and genetic programming

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 1, Issue , 1999, Pages 652-659

  Yu, Tina ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GENETIC PROGRAMMING;

EVEN-PARITY PROBLEMS; PROGRAM REPRESENTATIONS; PROGRAM STRUCTURES; SEARCH SPACES;

ABSTRACTING;

EID: 8844234445     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.781995     Document Type: Conference Paper

References (14)

1. P. J. Angeline. Genetic programming and emergent intelligence. Advances in Genetic Programming, K. E. Kinnear, Jr. (ed.), MIT Press, pp. 75-97, 1994.
2. K. Chellapilla. Evolving computer programs without subtree crossover. IEEE Transactions on Evolutionary Computation. 1(3):209-216, September, 1997.
3. T. Haynes. Perturbing the representation, recoding, and evaluation of chromosomes. Genetic Programming 1998: Proceedings of the Third Annual Conference. J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba and R. Riolo (eds.), Morgan Kaufmann, pp. 122-127, 1998.
4. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, 1992.
5. J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs, MIT Press, Cambridge, MA, 1994.
6. W. B. Langdon and R. Poli. Why ants are hard. Genetic Programming 1998: Proceedings of the Third Annual Conference. J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba and R. Riolo (eds.), Morgan Kaufmann, pp. 193-201, 1998.
7. W. B. Langdon and R. Poli. Why "building blocks" don't work on parity problems. Technical Report CSRP-98-17. The University of Birmingham, U. K. 1998.
8. A. Leonhardi, W. Reissenberger, T. Schmelmer, K. Weicker and N. Weicker. Development of problem-specific evolutionary algorithms. Fifth International Conference on Parallel Problem Solving from Nature. A. E. Eiben, T. Bäck, M. Schoenauer and H.-P. Schwefel (eds.). Springer, pp. 388-397, 1998.
9. R. Poli, J. Page and W. B. Langdon. Solving even-12, -13, -15, -17, -20 and -22 boolean parity problems using sub-machine code GP with smooth uniform crossover, smooth point mutation and demes. Technical report CSRP-99-2. The University of Birmingham, U. K. 1999.
10. J. P. Rosea and D. H. Ballard. Discovery of subroutines in genetic programming. Advances in Genetic Programming II, P. J. Angeline and K. E. Kinnear, Jr. (eds.), MIT Press, Cambridge, MA, pp. 177-201, 1996.
11. L. Spector. Simultaneous evolution of programs and their control structures. Advances in Genetic Programming II, P. J. Angeline and K. E. Kinnear, Jr. (eds.), MIT Press, Cambridge, MA, pp. 137-154, 1996.
12. D. H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, April 1997.
13. T. Yu and C. Clack. PolyGP: a polymorphic genetic programming system in haskell. Genetic Programming 1998: Proceedings of the Third Annual Conference. J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba and R. Riolo (eds.), Morgan Kaufmann, pp. 416-421, 1998.
14. T. Yu and C. Clack. Recursion, lambda abstractions and genetic programming. Genetic Programming 1998: Proceedings of the Third Annual Conference. J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba and R. Riolo (eds.), Morgan Kaufmann, pp. 422-431, 1998.