A divide & conquer strategy for improving efficiency and probability of success in genetic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3905 LNCS, Issue , 2006, Pages 13-23

  Fillon, Cyril ^a   Bartoli, Alberto ^a  

^a UNIVERSITY OF TRIESTE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATION THEORY; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; PROBLEM SOLVING; STRATEGIC PLANNING;

COMPUTATIONAL RESOURCES; DOMAINS; GENETIC PROGRAMMING; POPULATION SIZE;

GENETIC ALGORITHMS;

EID: 33745754781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11729976_2     Document Type: Conference Paper

References (11)

1. Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming - An Introduction; On the Automatic Evolution of Computer Programs and its Applications. (1998), Morgan Kaufmann, dpunkt.verlag
2. Cantu-Paz, E., Goldberg, D.E.: Are Multiple Runs of Genetic Algorithms Better than One? In Proceedings of the Genetic and Evolutionary Computation Conference GECCO'03, (2003), LNCS 2723, Springer-Verlag, 801-812
3. Daida, J.M., Samples, M.E., Byom, M.J.: Probing for Limits to Building Block Mixing with a Tunably-Difficult Problem for Genetic Programming. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO'05, June 25-29, (2005)
4. Daida, J.M.: Towards Identifying Populations that Increase the Likelihood of Success in Genetic Programming. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO'05, June 25-29, (2005)
5. Gathercole, C., Ross, P.: Small Populations Over Many Generations Can Beat Large Populations Over Few Generations in GP. In Koza, J.R. et al. eds GP, (1997), Morgan Kaufmann, 111-118
6. John R. Koza.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)
7. Langdon, W.B., Poli, R.: Why Ants are Hard. In Genetic Programming 1998: Proceedings of the Third Annual Conference (1998), Morgan Kaufmann publishers, 193-201
8. Luke, S.: When Short Runs Beat Long Runs. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO'01, (2001), Morgan Kaufmann publishers, 74-80
9. Luke, S., Balan, G.C., Panait, L.: Population Implosion in Genetic Programming. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO'03, (2003), LNCS 2724, Springer-Verlag, 1729-1739
10. Alba, E.; Tomassini, M.: Parallelism and Evolutionary Algorithms. Evolutionary Computation, IEEE Transactions on Volume 6, Issue 5, (October 2002) 443-462
11. Van Veldhuizen, D.A., Zydallis, J.B., Lamont, G.B.: Considerations in Engineering Parallel Multiobjective Evolutionary Algorithms. Evolutionary Computation, IEEE Transactions on Volume 7, Issue 2 (April 2003) 144-173