Skip to main content

4 Result(s)

within Andrew M. Sutton Remove this filter Artificial Intelligence Remove this filter Theory of Computation Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Symmetry Breaking for Voting Mechanisms

    Recently, Rowe and Aishwaryaprajna [FOGA 2019] introduced a simple majority vote technique that efficiently solves Jump with large gaps, OneMax with large noise, and any monotone function with a polynomial-size i...

    Preethi Sankineni, Andrew M. Sutton in Evolutionary Computation in Combinatorial … (2021)

  2. 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)

  3. No Access

    Chapter

    Parameterized Complexity Analysis of Randomized Search Heuristics

    This chapter compiles a number of results that apply the theory of parameterized algorithmics to the running-time analysis of randomized search heuristics such as evolutionary algorithms. The parameterized app...

    Frank Neumann, Andrew M. Sutton in Theory of Evolutionary Computation (2020)

  4. No Access

    Reference Work Entry In depth

    Genetic Algorithms — A Survey of Models and Methods

    This chapter first reviews the simple genetic algorithm. Mathematical models of the genetic algorithm are also reviewed, including the schema theorem, exact infinite population models, and exact Markov models ...

    Darrell Whitley, Andrew M. Sutton in Handbook of Natural Computing (2012)