Correlation length, isotropy and meta-stable states
Proceedings of the 16th annual international conference of the Center for Nonlinear Studies on Landscape paradigms in physics and biology : concepts, structures and dynamics: concepts, structures and dynamics
Autocorrelation coefficient for the graph bipartitioning problem
Theoretical Computer Science
A tractable Walsh analysis of SAT and its implications for genetic algorithms
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the landscape ruggedness of the quadratic assignment problem
Theoretical Computer Science
SIAM Review
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Evolutionary Computation
Rigorous hitting times for binary mutations
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
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Exact computation of the expectation curves of the bit-flip mutation using landscapes theory
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A methodology to find the elementary landscape decomposition of combinatorial optimization problems
Evolutionary Computation
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Local search and the local structure of NP-complete problems
Operations Research Letters
Local optima networks, landscape autocorrelation and heuristic search performance
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization
Journal of Heuristics
| Hi-index | 0.00 |
In order to understand the structure of a problem we need to measure some features of the problem. Some examples of measures suggested in the past are autocorrelation and fitness-distance correlation. Landscape theory, developed in the last years in the field of combinatorial optimization, provides mathematical expressions to efficiently compute statistics on optimization problems. In this paper we discuss how can we use landscape theory in the context of problem understanding and present two software tools that can be used to efficiently compute the mentioned measures.