Andrew M. Sutton

According to our database1, Andrew M. Sutton authored at least 79 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Theory of evolutionary computation - Special Issue Editorial.
Theor. Comput. Sci., 2020

Parameterized Complexity Analysis of Randomized Search Heuristics.
CoRR, 2020

Approximation Speed-Up by Quadratization on LeadingOnes.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Understanding transforms of pseudo-boolean functions.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Optimization of Chance-Constrained Submodular Functions.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

When resampling to cope with noise, use median, not mean.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

Evolving Solutions to Community-Structured Satisfiability Formulas.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Escaping Local Optima Using Crossover With Emergent Diversity.
IEEE Trans. Evol. Comput., 2018

Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Next generation genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Crossover can simulate bounded tree search on a fixed-parameter tractable optimization problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

On the runtime dynamics of the compact genetic algorithm on jump functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017
The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise.
IEEE Trans. Evol. Comput., 2017

Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas.
Algorithmica, 2017

Resampling vs Recombination: a Statistical Run Time Estimation.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Phase Transitions for Scale-Free SAT Formulas.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Stochastic-based robust dynamic resource allocation for independent tasks in a heterogeneous computing system.
J. Parallel Distributed Comput., 2016

Robustness of Ant Colony Optimization to Noise.
Evol. Comput., 2016

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.
CoRR, 2016

Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems.
Algorithmica, 2016

On the Robustness of Evolving Populations.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Graceful Scaling on Uniform Versus Steep-Tailed Noise.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Ant Colony Optimization Beats Resampling on Noisy Functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Escaping Local Optima with Diversity Mechanisms and Crossover.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015
Population size matters: Rigorous runtime results for maximizing the hypervolume indicator.
Theor. Comput. Sci., 2015

Editorial for the Special Issue on Theory of Evolutionary Algorithms 2014.
Evol. Comput., 2015

Fitness Probability Distribution of Bit-Flip Mutation.
Evol. Comput., 2015

The Benefit of Sex in Noisy Evolutionary Search.
CoRR, 2015

The Benefit of Recombination in Noisy Evolutionary Search.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014
The component model for elementary landscapes and partial neighborhoods.
Theor. Comput. Sci., 2014

The Max problem revisited: The importance of mutation in genetic programming.
Theor. Comput. Sci., 2014

Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem.
Evol. Comput., 2014

Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Parameterized complexity analysis of evolutionary algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Efficient identification of improving moves in a ball for pseudo-boolean problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Emulating C++0x concepts.
Sci. Comput. Program., 2013

Thomas Jansen: Analyzing Evolutionary Algorithms: The Computer Science Perspective - Springer, 2013, 255 pp, ISBN: 978-3-642-17338-7.
Genet. Program. Evolvable Mach., 2013

Fitness Function Distributions over Generalized Search Neighborhoods in the <i>q</i>-ary Hypercube.
Evol. Comput., 2013

Elementary landscapes: theory and applications.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
Genetic Algorithms - A Survey of Models and Methods.
Proceedings of the Handbook of Natural Computing, 2012

Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time.
Theor. Comput. Sci., 2012

A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
MosaiCode: Visualizing large scale software: A tool demonstration.
Proceedings of the 6th IEEE International Workshop on Visualizing Software for Understanding and Analysis, 2011

Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Approximating the distribution of fitness over hamming regions.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

2010
Directed Plateau Search for MAX-k-SAT.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Identification of Idiom Usage in C++ Generic Libraries.
Proceedings of the 18th IEEE International Conference on Program Comprehension, 2010

2009
A Theoretical Analysis of the k-Satisfiability Search Space.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

Estimating Bounds on Expected Plateau Size in MAXSAT Problems.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

Improved Robustness through Population Variance in Ant Colony Optimization.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

Abstracting the template instantiation relation in C++.
Proceedings of the 25th IEEE International Conference on Software Maintenance (ICSM 2009), 2009

Elementary landscape analysis.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Partial neighborhoods of elementary landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

A polynomial time computation of the exact correlation structure of k-satisfiability landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

2008
Resource Scheduling with Permutation Based Representations: Three Applications.
Proceedings of the Evolutionary Computation in Practice, 2008

The Impact of Global Structure on Search.
Proceedings of the Parallel Problem Solving from Nature, 2008

Automatically identifying C++0x concepts in function templates.
Proceedings of the 24th IEEE International Conference on Software Maintenance (ICSM 2008), September 28, 2008

Understanding elementary landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2007
Recovering UML class models from C++: A detailed explanation.
Inf. Softw. Technol., 2007

Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

How We Manage Portability and Configuration with the C Preprocessor.
Proceedings of the 23rd IEEE International Conference on Software Maintenance (ICSM 2007), 2007

Differential evolution and non-separability: using selective pressure to focus search.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

2006
PSO and multi-funnel landscapes: how cooperation might limit exploration.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

2005
Mappings for Accurately Reverse Engineering UML Class Models from C++.
Proceedings of the 12th Working Conference on Reverse Engineering, 2005

Context-Free Slicing of UML Class Models.
Proceedings of the 21st IEEE International Conference on Software Maintenance (ICSM 2005), 2005

Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005


  Loading...