The time complexity of maximum matching by simulated annealing
Journal of the ACM (JACM)
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
Machine Learning - Special issue on genetic algorithms
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Recombination, selection, and the genetic construction of computer programs
Recombination, selection, and the genetic construction of computer programs
Discovery of subroutines in genetic programming
Advances in genetic programming
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
The evolution of size and shape
Advances in genetic programming
Foundations of genetic programming
Foundations of genetic programming
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Genetic Programming and Evolvable Machines
Genetic Programming and Evolvable Machines
Some Considerations on the Reason for Bloat
Genetic Programming and Evolvable Machines
An Evaluation of EvolutionaryGeneralisation in Genetic Programming
Artificial Intelligence Review
Accurate Replication in Genetic Programming
Proceedings of the 6th International Conference on Genetic Algorithms
Complexity Compression and Evolution
Proceedings of the 6th International Conference on Genetic Algorithms
Limiting the Number of Fitness Cases in Genetic Programming Using Statistics
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Using Schema Theory To Explore Interactions Of Multiple Operators
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Convergence Rates For The Distribution Of Program Outputs
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the European Conference on Genetic Programming
Proceedings of the European Conference on Genetic Programming
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Genetic Programming Bloat with Dynamic Fitness
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Grammatical Evolution: Evolving Programs for an Arbitrary Language
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Concepts of Inductive Genetic Programming
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
General schema theory for genetic programming with subtree-swapping crossover: part I
Evolutionary Computation
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
Code growth in genetic programming
Code growth in genetic programming
General schema theory for genetic programming with subtree-swapping crossover: Part II
Evolutionary Computation
Genetic Programming and Evolvable Machines
Real royal road functions for constant population size
Theoretical Computer Science
Backward-chaining genetic programming
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Evolutionary Computation
On the Choice of the Offspring Population Size in Evolutionary Algorithms
Evolutionary Computation
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions
Evolutionary Computation
How randomized search heuristics find maximum cliques in planar graphs
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Convergence to global optima for genetic programming systems with dynamically scaled operators
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Some results about the Markov chains associated to GPs and general EAs
Theoretical Computer Science - Foundations of genetic algorithms
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Evolutionary algorithms and matroid optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Multi-optimization improves genetic programming generalization ability
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A markov chain framework for the simple genetic algorithm
Evolutionary Computation
Balancing accuracy and parsimony in genetic programming
Evolutionary Computation
Evolutionary induction of sparse neural trees
Evolutionary Computation
Effects of code growth and parsimony pressure on populations in genetic programming
Evolutionary Computation
Schemata evolution and building blocks
Evolutionary Computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Free lunches for function and program induction
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Canonical representation genetic programming
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Developmental plasticity in linear genetic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Operator equalisation, bloat and overfitting: a study on human oral bioavailability prediction
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Variable size population for dynamic optimization with genetic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Fitness landscapes and problem hardness in genetic programming
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Genetic Programming Theory and Practice VII
Genetic Programming Theory and Practice VII
Real royal road functions-where crossover provably is essential
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Convergence of program fitness landscapes
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
A simple but theoretically-motivated method to control bloat in genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Modularity in genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
No free lunch, program induction and combinatorial problems
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
A grammatical genetic programming approach to modularity in genetic algorithms
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
On the limiting distribution of program sizes in tree-based genetic programming
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Operator equalisation and bloat free GP
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Practical model of genetic programming's performance on rational symbolic regression problems
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Semantic building blocks in genetic programming
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
A Field Guide to Genetic Programming
A Field Guide to Genetic Programming
Open issues in genetic programming
Genetic Programming and Evolvable Machines
Dynamic scheduling with genetic programming
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Genetic programming, validation sets, and parsimony pressure
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Negative slope coefficient: a measure to characterize genetic programming fitness landscapes
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Using subtree crossover distance to investigate genetic programming dynamics
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Complexity and cartesian genetic programming
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Invariance of function complexity under primitive recursive functions
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Dynamic size populations in distributed genetic programming
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Operator-Based distance for genetic programming: subtree crossover distance
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Repeated patterns in tree genetic programming
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Sub-tree swapping crossover and arity histogram distributions
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
Geometric differential evolution on the space of genetic programs
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Time Series Forecasting for Dynamic Environments: The DyFor Genetic Program Model
IEEE Transactions on Evolutionary Computation
Crossover-Based Tree Distance in Genetic Programming
IEEE Transactions on Evolutionary Computation
Open issues in genetic programming
Genetic Programming and Evolvable Machines
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
PAC learning and genetic programming
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Computational complexity analysis of multi-objective genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms
Genetic Programming and Evolvable Machines
Hi-index | 0.00 |
We consider the theoretical results in GP so far and prospective areas for the future. We begin by reviewing the state of the art in genetic programming (GP) theory including: schema theories, Markov chain models, the distribution of functionality in program search spaces, the problem of bloat, the applicability of the no-free-lunch theory to GP, and how we can estimate the difficulty of problems before actually running the system. We then look at how each of these areas might develop in the next decade, considering also new possible avenues for theory, the challenges ahead and the open issues.