Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Epistasis in Genetic Algorithms: An Experimental Design Perspective
Proceedings of the 6th International Conference on Genetic Algorithms
Approximating Satisfiable Satisfiability Problems (Extended Abstract)
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Gene expression and scalable genetic search
Advances in evolutionary computing
Computing the epistasis variance of large-scale traveling salesman problems
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Gene Expression and Fast Construction of Distributed Evolutionary Representation
Evolutionary Computation
A Genetic Model: Analysis and Application to MAXSAT
Evolutionary Computation
Efficient Linkage Discovery by Limited Probing
Evolutionary Computation
Detecting the epistatic structure of generalized embedded landscape
Genetic Programming and Evolvable Machines
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
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
Lower and upper bounds for linkage discovery
IEEE Transactions on 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
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
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
Hyperplane initialized local search for MAXSAT
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Problem understanding through landscape theory
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Fitness function distributions over generalized search neighborhoods in the q-ary hypercube
Evolutionary Computation
| Hi-index | 0.00 |
Walsh Transforms measure all sources of nonlinear interactions for functions that have a bit representation. There can be exponentially many nonlinear interactions and exactly computing all Walsh coefficients is usually intractable for non-trivial functions. In this paper we will show that SAT problems evaluated as MAXSAT functions have a highly restricted set of nonzero Walsh coefficients and those coefficients can be computed in linear time with respect to the number of clauses. This analysis suggests why standard simple genetic algorithms should perform poorly on MAXSAT problems.