Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Foundations of genetic programming
Foundations of genetic programming
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application
Advances in evolutionary computing
Information Characteristics and the Structure of Landscapes
Evolutionary Computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Algebraic theory of recombination spaces
Evolutionary Computation
Scaling of program fitness spaces
Evolutionary Computation
Understanding elementary landscapes
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Partial neighborhoods of elementary landscapes
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Tunneling between optima: partition crossover for the traveling salesman problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
A Theoretical Analysis of the k-Satisfiability Search Space
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
A Field Guide to Genetic Programming
A Field Guide to Genetic Programming
Extending particle swarm optimisation via genetic programming
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Elementary landscape decomposition of the test suite minimization problem
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
Evolutionary optimization for ranking how-to questions based on user-generated contents
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Genetic Programming parity with only XOR is not elementary. GP parity can be represented as the sum of k/2+1 elementary landscapes. Statistics, including fitness distance correlation (FDC), of Parity's fitness landscape are calculated. Using Walsh analysis the eigen values and eigenvectors of the Laplacian of the two bit, three bit, n-bit and mutation only Genetic Algorithm fitness landscapes are given. Indeed all elementary bit string landscapes are related to the discrete Fourier functions. However most are rough (λ/d ≈ 1). Also in many cases fitness autocorrelation falls rapidly with distance. GA runs support eigenvalue/graph degree (λ/d) as a measure of the ruggedness of elementary landscapes for predicting problem difficulty. The elementary needle in a haystack (NIH) landscape is described.