Skip to main content

8 Result(s)

within Andrew M. Sutton Remove this filter Discrete Mathematics in Computer Science Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Approximation Speed-Up by Quadratization on LeadingOnes

    We investigate the quadratization of LeadingOnes in the context of the landscape for local search. We prove that a standard quadratization (i.e., its expression as a degree-2 multilinear polynomial) of LeadingOne...

    Andrew M. Sutton, Darrell Whitley in Parallel Problem Solving from Nature – PPSN XVI (2020)

  2. No Access

    Chapter and Conference Paper

    Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights

    We rigorously analyze the runtime of evolutionary algorithms for the classical knapsack problem where the weights are favorably correlated with the profits. Our result for the (

    Frank Neumann, Andrew M. Sutton in Parallel Problem Solving from Nature – PPSN XV (2018)

  3. No Access

    Chapter and Conference Paper

    Graceful Scaling on Uniform Versus Steep-Tailed Noise

    Recently, different evolutionary algorithms (EAs) have been analyzed in noisy environments. The most frequently used noise model for this was additive posterior noise (noise added after the fitness evaluation)...

    Tobias Friedrich, Timo Kötzing… in Parallel Problem Solving from Nature – PPS… (2016)

  4. No Access

    Chapter and Conference Paper

    Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms

    Population diversity is essential for avoiding premature convergence in Genetic Algorithms (GAs) and for the effective use of crossover. Yet the dynamics of how diversity emerges in populations are not well un...

    Duc-Cuong Dang, Tobias Friedrich… in Parallel Problem Solving from Nature – PPS… (2016)

  5. No Access

    Chapter and Conference Paper

    On the Robustness of Evolving Populations

    Most theoretical work that studies the benefit of recombination focuses on the ability of crossover to speed up optimization time on specific search problems. In this paper, we take a slightly different perspe...

    Tobias Friedrich, Timo Kötzing… in Parallel Problem Solving from Nature – PPS… (2016)

  6. No Access

    Chapter and Conference Paper

    The Benefit of Recombination in Noisy Evolutionary Search

    Practical optimization problems frequently include uncertainty about the quality measure, for example due to noisy evaluations. Thus, they do not allow for a straightforward application of traditional optimiza...

    Tobias Friedrich, Timo Kötzing, Martin S. Krejca… in Algorithms and Computation (2015)

  7. No Access

    Chapter and Conference Paper

    Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas

    We show that simple mutation-only evolutionary algorithms find a satisfying assignment on two similar models of random planted 3-CNF Boolean formulas in polynomial time with high probability in the high constr...

    Andrew M. Sutton, Frank Neumann in Parallel Problem Solving from Nature – PPSN XIII (2014)

  8. No Access

    Chapter and Conference Paper

    A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling

    We consider simple multi-start evolutionary algorithms applied to the classical NP-hard combinatorial optimization problem of Makespan Scheduling on two machines. We study the dependence of the runtime of this ty...

    Andrew M. Sutton, Frank Neumann in Parallel Problem Solving from Nature - PPSN XII (2012)