Genetic Programming with Local Hill-Climbing
暂无分享,去创建一个
[1] Dines Bjørner,et al. Baltic Computer Science , 1991, Lecture Notes in Computer Science.
[2] A. G. Ivakhnenko,et al. Polynomial Theory of Complex Systems , 1971, IEEE Trans. Syst. Man Cybern..
[3] Hitoshi Iba,et al. Genetic programming using a minimum description length principle , 1994 .
[4] Jan Gecsei,et al. Adaptation Algorithms for Binary Tree Networks , 1979, IEEE Transactions on Systems, Man, and Cybernetics.
[5] Jan M. Zytkow,et al. Data-Driven Approaches to Empirical Discovery , 1989, Artif. Intell..
[6] Sushil J. Louis,et al. Pareto OptimalityGA-Easiness and Deception (Extended Abstract) , 1993, International Conference on Genetic Algorithms.
[7] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[8] J. M. Barzdin,et al. Rapid Constructions of Algebraic Axioms From Samples , 1991, Theor. Comput. Sci..
[9] Hitoshi Iba,et al. System Identification using Structured Genetic Algorithms , 1993, ICGA.
[10] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[11] Dekang Lin,et al. LEARNING AND GENERALIZATION IN ADAPTIVE LOGIC NETWORKS *1This research has been partially supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) under operating grant OGP-5714. , 1991 .
[12] John R. Koza,et al. Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems , 1990 .
[13] John R. Koza,et al. Genetic programming 2 - automatic discovery of reusable programs , 1994, Complex Adaptive Systems.
[14] Larry J. Eshelman,et al. On Crossover as an Evolutionarily Viable Strategy , 1991, ICGA.