Redundant Representations in Evolutionary Computation
暂无分享,去创建一个
[1] D. Dasgupta. Incorporating Redundancy and Gene Activation Mechanisms in Genetic search for adapting to Non-Stationarv Environments. , 2019, Practical Handbook of Genetic Algorithms.
[2] Julian Francis Miller,et al. Finding Needles in Haystacks Is Not Hard with Neutrality , 2002, EuroGP.
[3] M. Shackleton,et al. An investigation of redundant genotype-phenotype mappings and their role in evolutionary search , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[4] Phil Husbands,et al. Neutral Networks and Evolvability with Complex Genotype-Phenotype Mapping , 2001, ECAL.
[5] Andreas T. Ernst,et al. Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree , 2001, J. Heuristics.
[6] Hillol Kargupta,et al. A Striking Property of Genetic Code-like Transformations , 2001, Complex Syst..
[7] L. Darrell Whitley,et al. Functions as Permutations: Regarding No Free Lunch, Walsh Analysis and Summary Statistics , 2000, PPSN.
[8] Paulien Hogeweg,et al. Redundant Coding of an NP-Complete Problem Allows Effective Genetic Algorithm Search , 1990, PPSN.
[9] P. Schuster,et al. Genotypes with phenotypes: adventures in an RNA toy world. , 1997, Biophysical chemistry.
[10] Irene A. Stegun,et al. Handbook of Mathematical Functions. , 1966 .
[11] M. Huynen,et al. Smoothness within ruggedness: the role of neutrality in adaptation. , 1996, Proceedings of the National Academy of Sciences of the United States of America.
[12] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[13] Christian M. Reidys,et al. Neutrality in fitness landscapes , 2001, Appl. Math. Comput..
[14] E. Cantu-Paz,et al. The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1997, Evolutionary Computation.
[15] Julian Francis Miller,et al. Neutrality and the Evolvability of Boolean Function Landscape , 2001, EuroGP.
[16] D. WhitleyComputer. A Free Lunch Proof for Gray versus Binary Encodings , 1999 .
[17] Zbigniew Michalewicz,et al. Evolutionary Computation 1 , 2018 .
[18] Kalyanmoy Deb,et al. Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..
[19] D. Ackley. A connectionist machine for genetic hillclimbing , 1987 .
[20] Dana S. Richards,et al. Floorplan design using distributed genetic algorithms , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.
[21] N. Packard,et al. Neutral search spaces for artificial evolution: a lesson from life , 2000 .
[22] Jeffrey D. Horn. Genetic Algorithms, Problem Difficulty, and the Modality of Fitness Landscapes , 1995 .
[23] N. Packard,et al. Neutral Search Spaces for Artificial Evolution: A Lesson From Life , 2000 .
[24] L. Barnett. TANGLED WEBS Evolutionary Dynamics on Fitness Landscapes with Neutrality , 1997 .
[25] Heinz Mühlenbein,et al. Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.
[26] L. Darrell Whitley,et al. Bit Representations with a Twist , 1997, ICGA.
[27] J. Asenstorfer,et al. Representational redundancy in evolutionary algorithms , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.
[28] Lionel Barnett,et al. Netcrawling-optimal evolutionary search with neutral networks , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[29] P. Husbands,et al. Neutral networks in an evolutionary robotics search space , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[30] Marc Ebner,et al. On neutral networks and evolvability , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[31] N. Pierce. Origin of Species , 1914, Nature.
[32] Lawrence Davis,et al. Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.
[33] Larry J. Eshelman,et al. Preventing Premature Convergence in Genetic Algorithms by Preventing Incest , 1991, ICGA.
[34] Marc Toussaint,et al. Neutrality: a necessity for self-adaptation , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[35] Franz Rothlauf,et al. Network Random KeysA Tree Representation Scheme for Genetic and Evolutionary Algorithms , 2002, Evolutionary Computation.
[36] Kalyanmoy Deb,et al. Analyzing Deception in Trap Functions , 1992, FOGA.
[37] Zbigniew Michalewicz,et al. Handbook of Evolutionary Computation , 1997 .
[38] Bryant A. Julstrom,et al. A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem , 2000, SAC '00.
[39] Charles C. Palmer,et al. An approach to a problem in network design using genetic algorithms , 1994, Networks.
[40] L. Darrell Whitley,et al. Evaluating Evolutionary Algorithms , 1996, Artif. Intell..
[41] Roger L. Wainwright,et al. Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem , 1995, ICGA.
[42] David E. Goldberg,et al. Optimal Sampling For Genetic Algorithms , 1996 .
[43] Richard A. Watson,et al. On the Utility of Redundant Encodings in Mutation-Based Evolutionary Search , 2002, PPSN.
[44] Franz Rothlauf,et al. Network random keys-a tree network representation scheme for genetic and evolutionary algorithms , 2000 .
[45] Wolfgang Banzhaf,et al. Genotype-Phenotype-Mapping and Neutral Variation - A Case Study in Genetic Programming , 1994, PPSN.
[46] L. Barnett. Ruggedness and neutrality—the NKp family of fitness landscapes , 1998 .
[47] Franz Rothlauf,et al. Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.
[48] Terry Jones,et al. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.
[49] Hillol Kargupta,et al. The Genetic Code-Like Transformations and Their Effect on Learning Functions , 2000, PPSN.
[50] Xin Yao,et al. Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.
[51] Franz Rothlauf,et al. Pruefer Numbers and Genetic Algorithms: A Lesson on How the Low Locality of an Encoding Can Harm the Performance of GAs , 2000, PPSN.
[52] Dirk Thierens,et al. Mixing in Genetic Algorithms , 1993, ICGA.
[53] Inman Harvey,et al. Through the Labyrinth Evolution Finds a Way: A Silicon Ridge , 1996, ICES.
[54] Reinhard Männer,et al. Parallel Problem Solving from Nature — PPSN III , 1994, Lecture Notes in Computer Science.
[55] David E. Goldberg,et al. Genetic Algorithms, Selection Schemes, and the Varying Effects of Noise , 1996, Evolutionary Computation.
[56] C. Mitter,et al. One Long Argument: Charles Darwin and the Genesis of Modern Evolutionary Thought , 1994 .
[57] E. Weinberger,et al. Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.
[58] R. Prim. Shortest connection networks and some generalizations , 1957 .
[59] Reinhard Männer,et al. Parallel Problem Solving from Nature , 1991 .
[60] Dirk Thierens,et al. Convergence Models of Genetic Algorithm Selection Schemes , 1994, PPSN.
[61] Bernard Manderick,et al. The Genetic Algorithm and the Structure of the Fitness Landscape , 1991, ICGA.
[62] R. Shipman,et al. Genetic Redundancy: Desirable or Problematic for Evolutionary Adaptation? , 1999, ICANNGA.
[63] Darrell Whitley. Functions as Permutations: Implications for No Free Lunch, Walsh Analysis and Statistics , 2000 .
[64] G. Raidl,et al. Prüfer numbers: a poor representation of spanning trees for evolutionary search , 2001 .
[65] Soraya B. Rana,et al. Representation Issues in Neighborhood Search and Evolutionary Algorithms , 1998 .
[66] Inman Harvey,et al. The Use of Neutral Genotype-Phenotype Mappings for Improved Evolutionary Search , 2000 .
[67] K. Holsinger. The neutral theory of molecular evolution , 2004 .
[68] Franz Rothlauf,et al. The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters , 2001, EvoWorkshops.
[69] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .
[70] Richard W. Hamming,et al. Coding and Information Theory , 1980 .
[71] Charles C. Palmer,et al. Representing trees in genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.