• Publications
  • Influence
Differential evolution and non-separability: using selective pressure to focus search
TLDR
We show that the Differential Evolution algorithm lacks sufficient selective pressure when appointing parent and donor vectors to have satisfactory exploitative power on non-separable functions. Expand
  • 54
  • 7
  • PDF
The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise
TLDR
We show that a simple genetic algorithm called the compact genetic algorithm can overcome the shortsightedness of mutation-only heuristics to scale gracefully with noise. Expand
  • 55
  • 5
The Impact of Global Structure on Search
TLDR
Population-based methods are often considered superior on multimodal functions because they tend to explore more of the fitness landscape before they converge. Expand
  • 34
  • 4
A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem
TLDR
We carry out a parameterized analysis of evolutionary algorithms for the Euclidean traveling salesperson problem (Euclidean TSP). Expand
  • 30
  • 4
  • PDF
Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time
TLDR
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). Expand
  • 24
  • 4
  • PDF
Efficient identification of improving moves in a ball for pseudo-boolean problems
TLDR
In this paper efficient methods areintroduced to locate improving moves in the r-ball neighborhood for problems that can be written as a sum of a linear number of subfunctions depending on a bounded number of variables. Expand
  • 30
  • 3
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes
TLDR
The autocorrelation function and related correlation length are statistical quantities that capture the ruggedness of the fitness landscape: a measure that is directly related to the hardness of a problem for certain heuristic search algorithms. Expand
  • 35
  • 3
  • PDF
Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment
TLDR
We present a methodology for quantifying the robustness of resource allocations in a dynamic environment where task execution times are stochastic. Expand
  • 31
  • 3
  • PDF
Phase Transitions for Scale-Free SAT Formulas
TLDR
We give a lower bound on the phase transition threshold as a function of the scaling parameter. Expand
  • 12
  • 3
PSO and multi-funnel landscapes: how cooperation might limit exploration
TLDR
Particle Swarm Optimization is a population-based optimization method in which search points employ a cooperative strategy to move toward one another. Expand
  • 44
  • 2
  • PDF