On the landscape ruggedness of the quadratic assignment problem
Theoretical Computer Science
SIAM Review
Evolutionary Computation
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Genetic algorithms as function optimizers
Genetic algorithms as function optimizers
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Advanced fitness landscape analysis and the performance of memetic algorithms
Evolutionary Computation - Special issue on magnetic algorithms
Gene Expression and Fast Construction of Distributed Evolutionary Representation
Evolutionary Computation
Efficient Linkage Discovery by Limited Probing
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
Local search and the local structure of NP-complete problems
Operations Research Letters
Approximating the distribution of fitness over hamming regions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
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
Elementary landscape decomposition of the test suite minimization problem
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Exact computation of the expectation curves for uniform crossover
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT
Proceedings of the 14th annual conference on Genetic and evolutionary computation
An empirical evaluation of o(1) steepest descent for NK-Landscapes
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Quasi-elementary landscapes and superpositions of elementary landscapes
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization
Journal of Heuristics
Fitness function distributions over generalized search neighborhoods in the q-ary hypercube
Evolutionary Computation
| Hi-index | 5.23 |
We show that given a k-bounded pseudo-Boolean function f, one can always compute the cth moment of f over regions of arbitrary radius in Hamming space in polynomial time using algebraic information from the adjacency structure (where k and c are constants). This result has implications for evolutionary algorithms and local search algorithms because information about promising regions of the search space can be efficiently retrieved, even if the cardinality of the region is exponential in the problem size. Finally, we use our results to introduce a method of efficiently calculating the expected fitness of mutations for evolutionary algorithms.