Frontiers of Evolutionary Computation

[1]  Lothar M. Schmitt,et al.  Theory of genetic algorithms , 2001, Theor. Comput. Sci..

[2]  C. Stephens.  Some exact results from a coarse grained formulation of genetic dynamics , 2001, nlin/0105029.

[3]  José Carlos Príncipe,et al.  A Simulated Annealing Like Convergence Theory for the Simple Genetic Algorithm , 1991, ICGA.

[4]  Riccardo Poli,et al.  Fitness Causes Bloat , 1998 .

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

[6]  Christian M. Reidys,et al.  Combinatorial Landscapes , 2002, SIAM Rev..

[7]  David E. Goldberg,et al.  The Design of Innovation , 2002, Genetic Algorithms and Evolutionary Computation.

[8]  Thomas Bäck,et al.  Theory of Genetic Algorithms , 2001, Current Trends in Theoretical Computer Science.

[9]  John R. Koza,et al.  Genetic Programming II , 1992 .

[10]  M. Huynen,et al.  Neutral evolution of mutational robustness. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Thomas Jansen,et al.  A New Framework for the Valuation of Algorithms for Black-Box Optimization , 2002, FOGA.

[12]  M. Arnone.  Bringing order to organogenesis , 2002, Nature Genetics.

[13]  Christopher R. Stephens,et al.  Effective Fitness as an Alternative Paradigm for Evolutionary Computation II: Examples and Applications , 2001, Genetic Programming and Evolvable Machines.

[14]  Andrés Gómez de Silva Garza,et al.  An Evolutionary Approach to Case Adaption , 1999, ICCBR.

[15]  M. Bunge.  Analogy in Quantum Theory: From Insight to Nonsense* , 1968, The British Journal for the Philosophy of Science.

[16]  Alden H. Wright,et al.  The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory , 1998, Evolutionary Computation.

[17]  Carlos Ramirez.  Schemata, Frames, and Dynamic Memory Structures , 1997 .

[18]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[19]  Lee Altenberg,et al.  The Schema Theorem and Price's Theorem , 1994, FOGA.

[20]  J. van Leeuwen,et al.  Evolutionary Multi-Criterion Optimization , 2003, Lecture Notes in Computer Science.

[21]  S. Tavaré,et al.  Computational Methods for the Coalescent , 1997 .

[22]  Rafael A. Perez,et al.  The schema theorem considered insufficient , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.

[23]  Phil Husbands,et al.  Neutral Networks and Evolvability with Complex Genotype-Phenotype Mapping , 2001, ECAL.

[24]  Arthur L. Samuel,et al.  AI, Where It Has Been and Where It Is Going , 1983, IJCAI.

[25]  O. Catoni.  Sharp large deviations estimates for simulated annealing algorithms , 1991 .

[26]  Ernst Haeckel.  Generelle Morphologie der Organismen , 1866 .

[27]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[28]  O. Catoni.  Applications of sharp large deviations estimates to optimal cooling schedules , 1991 .

[29]  David Leake,et al.  Case-Based Reasoning: Experiences, Lessons and Future Directions , 1996 .

[30]  H. Waelbroeck,et al.  Effective degrees of freedom in genetic algorithms , 1998 .

[31]  Roger C. Schank,et al.  Conceptual dependency: A theory of natural language understanding , 1972 .

[32]  A. Gonzalez,et al.  A case-based reasoning approach to real estate property appraisal , 1992 .

[33]  Justinian P. Rosca,et al.  Hierarchical Self-Organization in Genetic programming , 1994, ICML.

[34]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[35]  Peter Nordin,et al.  Complexity Compression and Evolution , 1995, ICGA.

[36]  Ingoo Han,et al.  Case-based reasoning supported by genetic algorithms for corporate bond rating , 1999 .

[37]  Richard C. Waters,et al.  The programmer's apprentice , 1990, ACM Press frontier series.

[38]  Hillol Kargupta.  Editorial: Computation in Gene Expression , 2004, Genetic Programming and Evolvable Machines.

[39]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[40]  Mary Czerwinski,et al.  Compaq Quicksource: Providing the Consumer with the Power of AI , 1993, AI Mag..

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

[42]  Qiuming Cheng.  Fractal functions, fractal surfaces, and wavelets , 1996 .

[43]  David E. Goldberg,et al.  A Genetic Algorithm for Parallel Simulated Annealing , 1992, PPSN.

[44]  Robert Azencott,et al.  Simulated annealing : parallelization techniques , 1992 .

[45]  Gary J. Koehler,et al.  A proof of the Vose-Liepins conjecture , 1994, Annals of Mathematics and Artificial Intelligence.

[46]  R. I. Reynolds.  Search heuristics of chess players of different calibers. , 1982, The American journal of psychology.

[47]  Pedro Larrañaga,et al.  Genetic Algorithms: Bridging the Convergence Gap , 1999, Theor. Comput. Sci..

[48]  Michael D. Vose,et al.  Modeling genetic algorithms with Markov chains , 1992, Annals of Mathematics and Artificial Intelligence.

[49]  Heinz Mühlenbein,et al.  6. Genetic algorithms , 2003 .

[50]  David H. Wolpert,et al.  What makes an optimization problem hard? , 1995, Complex..

[51]  Una-May O'Reilly,et al.  Genetic Programming II: Automatic Discovery of Reusable Programs. , 1994, Artificial Life.

[52]  Sushil J. Louis,et al.  Genetic learning for combinational logic design , 2005, Soft Comput..

[53]  R. Lewontin.  Sociobiology - A Caricature of Darwinism , 1976, PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association.

[54]  Gábor Renner,et al.  Spline interpolation with genetic algorithms , 1997, Proceedings of 1997 International Conference on Shape Modeling and Applications.

[55]  Gunar E. Liepins,et al.  Punctuated Equilibria in Genetic Search , 1991, Complex Syst..

[56]  David Mackay,et al.  Gaussian Processes - A Replacement for Supervised Neural Networks? , 1997 .

[57]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[58]  Edward E. Smith,et al.  The Case for Rules in Reasoning , 1992, Cogn. Sci..

[59]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[60]  H. Raiffa,et al.  Decisions with Multiple Objectives , 1993 .

[61]  John H. Holland,et al.  Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions , 2000, Evolutionary Computation.

[62]  W. A. Greene,et al.  A Non-Linear Schema Theorem for Genetic Algorithms , 2000, GECCO.

[63]  S. Mango,et al.  Regulation of Organogenesis by the Caenorhabditis elegans FoxA Protein PHA-4 , 2002, Science.

[64]  Roger C. Schank,et al.  Dynamic memory - a theory of reminding and learning in computers and people , 1983 .

[65]  Leen-Kiat Soh,et al.  Combining Genetic Algorithms and Case-Based Reasoning for Genetic Learning of a Casebase: A Conceptual Framework , 2001 .

[66]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[67]  Riccardo Poli,et al.  Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation , 1997, Evolutionary Computation.

[68]  Christopher R. Stephens,et al.  Self-Adaptation in Evolving Systems , 1997, Artificial Life.

[69]  Michael I. Jordan.  Learning in Graphical Models , 1999, NATO ASI Series.

[70]  C. R. Stephens,et al.  "Effective" fitness landscapes for evolutionary systems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[71]  Haldun Aytug,et al.  Stopping Criteria for Finite Length Genetic Algorithms , 1996, INFORMS J. Comput..

[72]  Peter F. Stadler,et al.  Landscapes on spaces of trees , 2002, Appl. Math. Comput..

[73]  John R. Koza,et al.  Genetic Programming IV: Routine Human-Competitive Machine Intelligence , 2003 .

[74]  James P. Crutchfield,et al.  Statistical Dynamics of the Royal Road Genetic Algorithm , 1999, Theor. Comput. Sci..

[75]  Shun-ichi Amari,et al.  Methods of information geometry , 2000 .

[76]  Lishan Kang,et al.  On the Convergence Rates of Genetic Algorithms , 1999, Theor. Comput. Sci..

[77]  Walter Böhm,et al.  Exact Uniform Initialization For Genetic Programming , 1996, FOGA.

[78]  Prügel-Bennett,et al.  Analysis of genetic algorithms using statistical mechanics. , 1994, Physical review letters.

[79]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[80]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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

[82]  Joe Suzuki,et al.  A Further Result on the Markov Chain Model of Genetic Algorithms and Its Application to a Simulated Annealing-like Strategy , 1998, FOGA.

[83]  Marvin Minsky,et al.  A framework for representing knowledge , 1974 .

[84]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[85]  Peter Nordin,et al.  The Effect of Extensive Use of the Mutation Operator on Generalization in Genetic Programming Using Sparse Data Sets , 1996, PPSN.

[86]  Christopher R. Stephens,et al.  Landscapes and Effective Fitness , 2003 .

[87]  Christopher R. Stephens,et al.  Effective Fitness as an Alternative Paradigm for Evolutionary Computation I: General Formalism , 2000, Genetic Programming and Evolvable Machines.

[88]  Riccardo Poli,et al.  Using Schema Theory To Explore Interactions Of Multiple Operators , 2002, GECCO.

[89]  David B. Fogel,et al.  The Schema Theorem and the Misallocation of Trials in the Presence of Stochastic Effects , 1998, Evolutionary Programming.

[90]  H. Dreyfus.  Mind Over Machine , 1986 .

[91]  Alden H. Wright,et al.  On The Search Biases Of Homologuous Crossover In Linear Genetic Programming And Variable-length Genetic Algorithms , 2002, GECCO.

[92]  F. Harold.  The Way of the Cell , 2001 .

[93]  Paul J. Kennedy,et al.  A Model of Gene Expression and Regulation in an Artificial Cellular Organism , 2001, Complex Syst..

[94]  M. McKinney,et al.  Heterochrony: beyond words , 1999, Paleobiology.

[95]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[96]  David C. Wilson,et al.  When Experience Is Wrong: Examining CBR for Changing Tasks and Environments , 1999, ICCBR.

[97]  W. Greub.  Linear Algebra , 1981 .

[98]  E. Davidson.  Genomic Regulatory Systems , 2001 .

[99]  O. Catoni.  Rough Large Deviation Estimates for Simulated Annealing: Application to Exponential Schedules , 1992 .

[100]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[101]  David McSherry,et al.  Diversity-Conscious Retrieval , 2002, ECCBR.

[102]  C. Stephens.  The Renormalization Group and the Dynamics of Genetic Systems , 2002, cond-mat/0210271.

[103]  Thomas Lux,et al.  Genetic learning as an explanation of stylized facts of foreign exchange markets , 2003, 2003 IEEE International Conference on Computational Intelligence for Financial Engineering, 2003. Proceedings..

[104]  Christopher R. Stephens,et al.  Schemata as Building Blocks: Does Size Matter? , 2000, FOGA.

[105]  Alden H. Wright,et al.  A Schema-Theory-Based Extension of Geiringer's Theorem for Linear GP and Varialbe-length GAs under Homologous Crossover , 2002, FOGA.

[106]  Roger C. Schank,et al.  SCRIPTS, PLANS, GOALS, AND UNDERSTANDING , 1988 .

[107]  Riccardo Poli,et al.  Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover , 2001, Genetic Programming and Evolvable Machines.

[108]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[109]  Peter Nordin,et al.  Evolutionary program induction of binary machine code and its applications , 1997 .

[110]  H. H. Schaefer.  Banach Lattices and Positive Operators , 1975 .

[111]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[112]  Tatsuya Nomura,et al.  An Analysis of Two-Parent Recombinations for Real-Valued Chromosomes in an Infinite Population , 2001, Evolutionary Computation.

[113]  F. Harold.  Gleanings of a chemiosmotic eye. , 2001, BioEssays : news and reviews in molecular, cellular and developmental biology.

[114]  John R. Koza.  Hierarchical Automatic Function Definition in Genetic Programming , 1992, FOGA.

[115]  Gerard T. Barkema,et al.  Monte Carlo Methods in Statistical Physics , 1999 .

[116]  M. S. Mayzner,et al.  Cognition And Reality , 1976 .

[117]  Luigi Portinale,et al.  Speed-Up, Quality and Competence in Multi-modal Case-Based Reasoning , 1999, ICCBR.

[118]  Kenneth D. Forbus,et al.  MAC/FAC: A Model of Similarity-Based Retrieval , 1995, Cogn. Sci..

[119]  Stefan Wess,et al.  Case-Based Reasoning Technology: From Foundations to Applications , 1998, Lecture Notes in Computer Science.

[120]  Elie Bienenstock,et al.  Neural Networks and the Bias/Variance Dilemma , 1992, Neural Computation.

[121]  Ingo Wegener,et al.  Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..

[122]  Kenneth J. McNamara,et al.  Heterochrony: The Evolution of Ontogeny , 1991 .

[123]  R. Buerger.  The Mathematical Theory of Selection, Recombination, and Mutation , 2000 .

[124]  Katy Börner.  CBR for Design , 1998, Case-Based Reasoning Technology.

[125]  David B. Fogel,et al.  Schema processing under proportional selection in the presence of random effects , 1997, IEEE Trans. Evol. Comput..

[126]  Chrystopher L. Nehaniv,et al.  Linear Analysis of Genetic Algorithms , 1998, Theor. Comput. Sci..

[127]  Lawrence Davis,et al.  Hybridizing the Genetic Algorithm and the K Nearest Neighbors Classification Algorithm , 1991, ICGA.

[128]  T. Traut,et al.  A minimal gene set for cellular life derived by comparison of complete bacterial genomes , 1998 .

[129]  E. Reed.  Ways of thinking , 1990, Nature.

[130]  Alden H. Wright,et al.  Allele Diffusion in Linear Genetic Programming and Variable-Length Genetic Algorithms with Subtree Crossover , 2002, EuroGP.

[131]  S Wright,et al.  "Surfaces" of selective value. , 1967, Proceedings of the National Academy of Sciences of the United States of America.

[132]  Raphaël Cerf,et al.  An Asymptotic Theory of Genetic Algorithms , 1995, Artificial Evolution.

[133]  Barry Smyth,et al.  Improving Recommendation Diversity , 2001 .

[134]  The Linear Geometry of Genetic Operators with Applications to the Analysis of Genetic Drift and Genetic Algorithms Using Tournament Selection , 2001 .

[135]  Michael D. Vose,et al.  Random Heuristic Search , 1999, Theor. Comput. Sci..

[136]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[137]  Angelo Cangelosi,et al.  Heterochrony and Adaptation in Developing Neural Networks , 1999, GECCO.

[138]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[139]  J. Ross Quinlan,et al.  Induction of Decision Trees , 1986, Machine Learning.

[140]  Riccardo Poli,et al.  Boolean Functions Fitness Spaces , 1999, EuroGP.

[141]  Kagan Tumer,et al.  Improving Simulated Annealing by Recasting it as a Non-Cooperative Game , 2001 .

[142]  N. Charness.  Search in chess: Age and skill differences. , 1981 .

[143]  Kai Lai Chung,et al.  A Course in Probability Theory , 1949 .

[144]  R. Poli,et al.  Exact schema theory for GP and variable-length GAs with homologous crossover , 2001 .

[145]  David E. Goldberg,et al.  Parallel Recombinative Simulated Annealing: A Genetic Algorithm , 1995, Parallel Comput..

[146]  Awi Federgruen,et al.  Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods , 1987, Oper. Res..

[147]  David E. Goldberg,et al.  A Note on Boltzmann Tournament Selection for Genetic Algorithms and Population-Oriented Simulated Annealing , 1990, Complex Syst..

[148]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[149]  Christopher K. Riesbeck,et al.  Inside Case-Based Reasoning , 1989 .

[150]  Riccardo Poli,et al.  Exact Schema Theorem and Effective Fitness for GP with One-Point Crossover , 2000, GECCO.

[151]  Christopher R. Stephens,et al.  Schemata Evolution and Building Blocks , 1999, Evolutionary Computation.

[152]  Riccardo Poli,et al.  Foundations of Genetic Programming , 1999, Springer Berlin Heidelberg.

[153]  T. Mansour.  Counting peaks at height k in a Dyck path , 2002, math/0203222.

[154]  K. Holyoak,et al.  Surface and structural similarity in analogical transfer , 1987, Memory & cognition.

[155]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[156]  John N. Hooker,et al.  Testing heuristics: We have it all wrong , 1995, J. Heuristics.

[157]  R. Cerf.  Asymptotic convergence of genetic algorithms , 1998, Advances in Applied Probability.

[158]  Christopher R. Stephens,et al.  Effective Degrees of Freedom in Genetic Algorithms and the Block Hypothesis , 1997, ICGA.

[159]  Deepak Khemani,et al.  InfoFrax : CBR in Fused Cast Refractory Manufacture , 2002, ECCBR.

[160]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[161]  L. Schmitt,et al.  Optimization of Mass Distribution in Articulated Figures with Genetic Algorithms , 2001 .

[162]  C. Stephens.  Effect of mutation and recombination on the genotype-phenotype map , 1999, nlin/0006051.

[163]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[164]  Carlos A. Coello Coello,et al.  Extraction and reuse of design patterns from genetic algorithms using case-based reasoning , 2005, Soft Comput..

[165]  Hans-Paul Schwefel,et al.  How to analyse evolutionary algorithms , 2002, Theor. Comput. Sci..

[166]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[167]  P. Nordin.  Genetic Programming III - Darwinian Invention and Problem Solving , 1999 .

[168]  Samir W. Mahfoud.  Finite Markov Chain Models of an Alternative Selection Strategy for the Genetic Algorithm , 1993, Complex Syst..

[169]  D. Medin,et al.  The specific character of abstract thought: Categorization, problem-solving, and induction: Volume 5 , 1989 .

[170]  Tim Jones.  Evolutionary Algorithms, Fitness Landscapes and Search , 1995 .

[171]  Riccardo Poli,et al.  General Schema Theory for Genetic Programming with Subtree-Swapping Crossover , 2001, EuroGP.

[172]  A. Townsend.  Genetic Algorithms – a Tutorial , 2003 .

[173]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[174]  Barry Smyth,et al.  Building Compact Competent Case-Bases , 1999, ICCBR.

[175]  Alden H. Wright,et al.  The Simple Genetic Algorithm and the Walsh Transform: Part II, The Inverse , 1998, Evolutionary Computation.

[176]  Garrison W. Greenwood,et al.  Convergence in Evolutionary Programs with Self-Adaptation , 2001, Evolutionary Computation.

[177]  Christian M. Reidys,et al.  Neutrality in fitness landscapes , 2001, Appl. Math. Comput..

[178]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[180]  H. Kushner.  Asymptotic global behavior for stochastic approximation and diffusions with slowly decreasing noise effects: Global minimization via Monte Carlo , 1987 .

[181]  John N. Hooker,et al.  Logic-Based Methods for Optimization , 1994, PPCP.

[182]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[183]  R. Poli,et al.  Cognitive Science Research Reports 2001: Markov models for GP and variable-length GAs with homologous crossover , 2001 .

[184]  R. Poli.  Why the schema theorem is correct also in the presence of stochastic effects , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

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

[186]  Vladimir V. Savchenko,et al.  Reconstructing occlusal surfaces of teeth using a genetic algorithm with simulated annealing type selection , 2001, SMA '01.

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