Fundamental Concepts of Evolutionary Computation

[1]  Günter Rudolph,et al.  Convergence of evolutionary algorithms in general search spaces , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[2]  David B. Fogel,et al.  Tuning Evolutionary Programming for Conformationally Flexible Molecular Docking , 1996, Evolutionary Programming.

[3]  Günter Rudolph,et al.  A cellular genetic algorithm with self-adjusting acceptance threshold , 1995 .

[4]  Jeffrey S. Rosenthal,et al.  Convergence Rates for Markov Chains , 1995, SIAM Rev..

[5]  M W Feldman,et al.  Population structure, fitness surfaces, and linkage in the shifting balance process. , 1995, Genetical research.

[6]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[7]  L. Darrell Whitley,et al.  Building Better Test Functions , 1995, ICGA.

[8]  Günter Rudolph,et al.  Contemporary Evolution Strategies , 1995, ECAL.

[9]  A. Perelson,et al.  Protein evolution on partially correlated landscapes. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[10]  David B. Fogel,et al.  CONTINUOUS EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS , 1995 .

[11]  David B. Fogel,et al.  Docking Conformationally Flexible Small Molecules into a Protein Binding Site through Evolutionary Programming , 1995, Evolutionary Programming.

[12]  W. Spears,et al.  On the Virtues of Parameterized Uniform Crossover , 1995 .

[13]  Alden H. Wright,et al.  Simple Genetic Algorithms with Linear Fitness , 1994, Evolutionary Computation.

[14]  Nikolaus Hansen,et al.  A Derandomized Approach to Self-Adaptation of Evolution Strategies , 1994, Evolutionary Computation.

[15]  L. Altenberg.  The evolution of evolvability in genetic programming , 1994 .

[16]  Günter Rudolph,et al.  Convergence of non-elitist strategies , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[17]  Patrik D'haeseleer,et al.  Context preserving crossover in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[18]  Timothy Perkis,et al.  Stack-based genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[19]  D. Fogel.  ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS , 1994 .

[20]  Peter J. B. Hancock,et al.  An Empirical Comparison of Selection Methods in Evolutionary Algorithms , 1994, Evolutionary Computing, AISB Workshop.

[21]  Sami Khuri,et al.  Walsh and Haar functions in genetic algorithms , 1994, SAC '94.

[22]  William E. Hart,et al.  The Role of Development in Genetic Algorithms , 1994, FOGA.

[23]  Karl Sims,et al.  Evolving 3D Morphology and Behavior by Competition , 1994, Artificial Life.

[24]  Patrick D. Surry,et al.  Fitness Variance of Formae and Performance Prediction , 1994, FOGA.

[25]  José Carlos Príncipe,et al.  A Markov Chain Framework for the Simple Genetic Algorithm , 1993, Evolutionary Computation.

[26]  Willfried Wienholt,et al.  A Refined Genetic Algorithm for Parameter Optimization Problems , 1993, ICGA.

[27]  Frédéric Gruau,et al.  Genetic Synthesis of Modular Neural Networks , 1993, ICGA.

[28]  K. Twardowski.  Credit Assignment for Pole Balancing with Learning Classifier Systems , 1993, ICGA.

[29]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

[30]  Kenneth E. Kinnear,et al.  Generality and Difficulty in Genetic Programming: Evolving a Sort , 1993, ICGA.

[31]  John H. Holland,et al.  When will a Genetic Algorithm Outperform Hill Climbing , 1993, NIPS.

[32]  Marco Dorigo,et al.  Implicit Parallelism in Genetic Algorithms , 1993, Artif. Intell..

[33]  Peter J. Angeline,et al.  Competitive Environments Evolve Better Solutions for Complex Tasks , 1993, ICGA.

[34]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[35]  D. Adler,et al.  Genetic algorithms and simulated annealing: a marriage proposal , 1993, IEEE International Conference on Neural Networks.

[36]  John R McDonnell,et al.  Training Neural Networks with Weight Constraints , 1993 .

[37]  Weinberger,et al.  RNA folding and combinatory landscapes. , 1993, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[38]  D. Fogel.  Applying evolutionary programming to selected traveling salesman problems , 1993 .

[39]  P. Stadler,et al.  Correlation structure of the landscape of the graph-bipartitioning problem , 1992 .

[40]  P. Stadler,et al.  The landscape of the traveling salesman problem , 1992 .

[41]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[42]  Kenneth A. De Jong,et al.  Genetic Algorithms are NOT Function Optimizers , 1992, FOGA.

[43]  J. D. Schaffer,et al.  Real-Coded Genetic Algorithms and Interval-Schemata , 1992, FOGA.

[44]  Melanie Mitchell,et al.  Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.

[45]  Kenneth A. De Jong,et al.  Are Genetic Algorithms Function Optimizers? , 1992, PPSN.

[46]  L. Darrell Whitley,et al.  An Executable Model of a Simple Genetic Algorithm , 1992, FOGA.

[47]  Kenneth A. De Jong,et al.  Generation Gaps Revisited , 1992, FOGA.

[48]  John J. Grefenstette,et al.  Deception Considered Harmful , 1992, FOGA.

[49]  Weinberger,et al.  Local properties of Kauffman's N-k model: A tunably rugged energy landscape. , 1991, Physical review. A, Atomic, molecular, and optical physics.

[50]  D. Fogel.  The evolution of intelligent decision making in gaming , 1991 .

[51]  Bernard Manderick,et al.  The Genetic Algorithm and the Structure of the Fitness Landscape , 1991, ICGA.

[52]  Manuel Valenzuela-Rendón,et al.  The Fuzzy Classifier System: A Classifier System for Continuously Varying Variables , 1991, ICGA.

[53]  Kenneth A. De Jong,et al.  On the Virtues of Parameterised Uniform Crossover , 1991, ICGA.

[54]  Zbigniew Michalewicz,et al.  An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms , 1991, ICGA.

[55]  Kalyanmoy Deb,et al.  Don't Worry, Be Messy , 1991, ICGA.

[56]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[57]  Melanie Mitchell,et al.  The royal road for genetic algorithms: Fitness landscapes and GA performance , 1991 .

[58]  Nicholas J. Radcliffe,et al.  Forma Analysis and Random Respectful Recombination , 1991, ICGA.

[59]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[60]  D. B. Fogel,et al.  Optimal routing of multiple autonomous underwater vehicles through evolutionary programming , 1990, Symposium on Autonomous Underwater Vehicle Technology.

[61]  GUNAR E. LIEPINS,et al.  Representational issues in genetic optimization , 1990, J. Exp. Theor. Artif. Intell..

[62]  Larry J. Eshelman,et al.  Spurious Correlations and Premature Convergence in Genetic Algorithms , 1990, FOGA.

[63]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[64]  L. Darrell Whitley,et al.  Fundamental Principles of Deception in Genetic Search , 1990, FOGA.

[65]  Alden H. Wright,et al.  Genetic Algorithms for Real Parameter Optimization , 1990, FOGA.

[66]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[67]  Lashon B. Booker,et al.  Triggered Rule Discovery in Classifier Systems , 1989, ICGA.

[68]  John R. Koza,et al.  Hierarchical Genetic Algorithms Operating on Populations of Computer Programs , 1989, IJCAI.

[69]  Jim Antonisse,et al.  A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint , 1989, ICGA.

[70]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[71]  L. D. Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, ICGA.

[72]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[73]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[74]  Tang,et al.  Self-organized criticality. , 1988, Physical review. A, General physics.

[75]  Hans-Paul Schwefel,et al.  Evolutionary Learning Optimum-Seeking on Parallel Computer Architectures , 1988 .

[76]  J. David Schaffer,et al.  Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms , 1988, ML.

[77]  David E. Goldberg,et al.  An Analysis of Reproduction and Crossover in a Binary-Coded Genetic Algorithm , 1987, ICGA.

[78]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[79]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[80]  M. Strintzis,et al.  Genetic Operators for High-Level Knowledge Representations , 1987, ICGA.

[81]  S. Kauffman,et al.  Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.

[82]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

[83]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[84]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[85]  Lashon B. Booker,et al.  Improving the Performance of Genetic Algorithms in Classifier Systems , 1985, ICGA.

[86]  Stewart W. Wilson.  Knowledge Growth in an Artificial Animal , 1985, ICGA.

[87]  J. D. Schaffer,et al.  Multiple Objective Optimization with Vector Evaluated Genetic Algorithms , 1985, ICGA.

[88]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[89]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[90]  Underwood Dudley.  Elementary Number Theory , 1978 .

[91]  J. Kingman.  A simple model for the balance between selection and mutation , 1978, Journal of Applied Probability.

[92]  John H. Holland,et al.  COGNITIVE SYSTEMS BASED ON ADAPTIVE ALGORITHMS1 , 1978 .

[93]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[94]  John Maynard Smith,et al.  Natural Selection and the Concept of a Protein Space , 1970, Nature.

[95]  Hans-Paul Schwefel,et al.  TWO-PHASE NOZZLE AND HOLLOW CORE JET EXPERIMENTS. , 1970 .

[96]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[97]  R. Bucy,et al.  Stability and positive supermartingales , 1965 .

[98]  A. Haar.  Zur Theorie der orthogonalen Funktionensysteme , 1910 .