Exaptation as a Means of Evolving Complex Solutions
暂无分享,去创建一个
[1] X. Yao. Evolving Artificial Neural Networks , 1999 .
[2] Yamashita,et al. Backpropagation algorithm which varies the number of hidden units , 1989 .
[3] Helen G. Cobb,et al. An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments , 1990 .
[4] Darrell Whitley,et al. A genetic algorithm tutorial , 1994, Statistics and Computing.
[5] S. Gould,et al. Exaptation—a Missing Term in the Science of Form , 1982, Paleobiology.
[6] John J. Grefenstette,et al. Genetic Algorithms for Changing Environments , 1992, PPSN.
[7] Robert F. Harrison,et al. Optimization and training of feedforward neural networks by genetic algorithms , 1991 .
[8] Luis Torres-T,et al. GA with Exaptation: New Algorithms to Tackle Dynamic Problems , 2004, MICAI.
[9] W. Martin,et al. Population Structures C 6 . 3 Island ( migration ) models : evolutionary algorithms based on punctuated equilibria , 1997 .
[10] W. Cedeno,et al. On the use of niching for dynamic landscapes , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[11] Mark Wineberg,et al. The Shifting Balance Genetic Algorithm: improving the GA in a dynamic environment , 1999 .
[12] Zbigniew Michalewicz,et al. Handbook of Evolutionary Computation , 1997 .
[13] Jürgen Branke,et al. Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[14] Richard Walker,et al. Niche Selection and the Evolution of Complex Behavior in a Changing EnvironmentA Simulation , 1999, Artificial Life.
[15] Franz Oppacher,et al. Reconstructing the shifting balance theory in a GA: taking Sewall Wright seriously , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[16] Riccardo Poli,et al. 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 , 1999 .
[17] Parag C. Pendharkar,et al. An empirical study of impact of crossover operators on the performance of non-binary genetic algorithm based neural approaches for classification , 2004, Comput. Oper. Res..
[18] James P. Cohoon,et al. C6.3 Island (migration) models: evolutionary algorithms based on punctuated equilibria , 1997 .
[19] Chris Thornton. Separability is a Learner's Best Friend , 1997, NCPW.
[20] L. Darrell Whitley,et al. Genetic algorithms and neural networks: optimizing connections and connectivity , 1990, Parallel Comput..
[21] Alberto Tesi,et al. On the Problem of Local Minima in Backpropagation , 1992, IEEE Trans. Pattern Anal. Mach. Intell..
[22] Roy L. Johnston,et al. Development and optimisation of a novel genetic algorithm for studying model protein folding , 2004 .
[23] T. Schopf. Models in Paleobiology , 1972 .
[24] Michael L. Mauldin,et al. Maintaining Diversity in Genetic Search , 1984, AAAI.
[25] Narayan Raman,et al. The job shop tardiness problem: A decomposition approach , 1993 .
[26] David B. Fogel,et al. Alternative Neural Network Training Methods , 1995, IEEE Expert.
[27] J. D. Schaffer,et al. Combinations of genetic algorithms and neural networks: a survey of the state of the art , 1992, [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks.
[28] Jürgen Branke,et al. A Multi-population Approach to Dynamic Optimization Problems , 2000 .
[29] Vasant Honavar,et al. Evolutionary Design of Neural Architectures , 1995 .
[30] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .