A multi-chromosome approach to standard and embedded cartesian genetic programming
暂无分享,去创建一个
[1] Mihai Oltean,et al. Encoding Multiple Solutions in a Linear Genetic Programming Chromosome , 2004, International Conference on Computational Science.
[2] Stephen L. Smith,et al. The performance of polyploid evolutionary algorithms is improved both by having many chromosomes and by having many copies of each chromosome on symbolic regression problems , 2005, 2005 IEEE Congress on Evolutionary Computation.
[3] John R. Koza,et al. Genetic programming 2 - automatic discovery of reusable programs , 1994, Complex Adaptive Systems.
[4] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[5] Julian Francis Miller,et al. Towards the automatic design of more efficient digital circuits , 2000, Proceedings. The Second NASA/DoD Workshop on Evolvable Hardware.
[6] Rachel Cavill,et al. Multi-chromosomal genetic programming , 2005, GECCO '05.
[7] Peter Ross,et al. Investigating Multipoidy's Niche , 1996, Evolutionary Computing, AISB Workshop.
[8] Mihai Oltean,et al. Evolving digital circuits using multi expression programming , 2004, Proceedings. 2004 NASA/DoD Conference on Evolvable Hardware, 2004..
[9] Peter J. Angeline,et al. Evolutionary Module Acquisition , 1993 .
[10] Lee Spector,et al. Evolving teamwork and coordination with genetic programming , 1996 .
[11] Julian Francis Miller,et al. Evolution and Acquisition of Modules in Cartesian Genetic Programming , 2004, EuroGP.
[12] Julian Francis Miller,et al. Investigating the performance of module acquisition in cartesian genetic programming , 2005, GECCO '05.
[13] Terence Soule. Heterogeneity and Specialization in Evolving Teams , 2000, GECCO.
[14] W. Daniel Hillis,et al. Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .
[15] Marc Schoenauer,et al. Polar IFS+Parisian Genetic Programming=Efficient IFS Inverse Problem Solving , 2000, Genetic Programming and Evolvable Machines.
[16] Julian Francis Miller,et al. Neutrality and the Evolvability of Boolean Function Landscape , 2001, EuroGP.
[17] Helmut A. Mayer,et al. Multi-chromosomal representations and chromosome shuffling in evolutionary algorithms , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..
[18] Jim Torresen,et al. Evolving Multiplier Circuits by Training Set and Training Vector Partitioning , 2003, ICES.
[19] J. Miller. An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach , 1999 .
[20] Julian Francis Miller,et al. Improving the Evolvability of Digital Multipliers Using Embedded Cartesian Genetic Programming and Product Reduction , 2005, ICES.
[21] Sandip Sen,et al. Evolving a Team , 1995 .
[22] Rick Chow,et al. Evolving Genotype to Phenotype Mappings with a Multiple-Chromosome Genetic Algorithm , 2004, GECCO.
[23] Terence Soule,et al. Voting teams: a cooperative approach to non-typical problems using genetic programming , 1999 .
[24] Julian Francis Miller,et al. Cartesian genetic programming , 2000, GECCO '10.