Benchmarking the generalization capabilities of a compiling genetic programming system using sparse data sets
暂无分享,去创建一个
[1] Peter Nordin,et al. Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code , 1995, ICGA.
[2] Peter Nordin,et al. Complexity Compression and Evolution , 1995, ICGA.
[3] M. Kauffman,et al. Off-Training Set Error and A Priori Distinctions Between Learning Algorithms , 1994 .
[4] Peter J. Angeline,et al. Explicitly Defined Introns and Destructive Crossover in Genetic Programming , 1996 .
[5] Robert G. Reynolds,et al. Extracting Design Knowledge from Genetic Programs Using Cultural Algorithms , 1996, Evolutionary Programming.
[6] Samir W. Mahfoud. Niching methods for genetic algorithms , 1996 .
[7] Timothy Masters,et al. Advanced algorithms for neural networks: a C++ sourcebook , 1995 .
[8] John R. Koza,et al. Genetic programming (videotape): the movie , 1992 .
[9] Vidroha Debroy,et al. Genetic Programming , 1998, Lecture Notes in Computer Science.
[10] Peter Nordin,et al. A compiling genetic programming system that directly manipulates the machine-code , 1994 .
[11] Timothy Masters,et al. Advanced algorithms for neural networks: a C++ sourcebook , 1995 .
[12] W. Spears,et al. For Every Generalization Action, Is There Really an Equal and Opposite Reaction? , 1995, ICML.