Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
On classifications of fitness functions
Theoretical aspects of evolutionary computing
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
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
The Density of States - A Measure of the Difficulty of Optimisation Problems
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Information landscapes and the analysis of search algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A comparison of predictive measures of problem difficulty inevolutionary algorithms
IEEE Transactions on Evolutionary Computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
A survey of techniques for characterising fitness landscapes and some possible ways forward
Information Sciences: an International Journal
| Hi-index | 0.01 |
We show that a fitness function, when taken together with an algorithm, can be reformulated as a set of probability distributions. This set can, in some cases, be equivalently viewed as an information vector which gives ordering information about pairs of search points in the domain. Certain performance criteria definable over such an information vector can be learned by linear regression in such a way that extrapolations can sometimes be made: the regression can make performance predictions about functions it has not seen. In addition, the vector can be taken as a model of the fitness function and used to compute features of it like difficultly via vector calculations.