Andrew M. Sutton

According to our database, Andrew M. Sutton authored at least 93 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs.

Luke Branson, Andrew M. Sutton

Theor. Comput. Sci., March, 2023

Symmetry Breaking for Voting Mechanisms.

Preethi Sankineni, Andrew M. Sutton

Evol. Comput., 2023

Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems.

Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Runtime Analysis with Variable Cost.

Per Kristian Lehre, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers.

Jack Kearney, Frank Neumann, Andrew M. Sutton

Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

Finding Antimagic Labelings of Trees by Evolutionary Search.

Luke Branson, Andrew M. Sutton, Xiankun Yan

Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

2022

Runtime Analysis of Unbalanced Block-Parallel Evolutionary Algorithms.

Brahim Aboutaib, Andrew M. Sutton

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Evolving labelings of graceful graphs.

Luke Branson, Andrew M. Sutton

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

The influence of noise on multi-parent crossover for an island model GA.

Brahim Aboutaib, Andrew M. Sutton

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

2021

Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs.

Andrew M. Sutton, Carsten Witt

Algorithmica, 2021

Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem.

Andrew M. Sutton

Algorithmica, 2021

Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily.

Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights.

Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems.

Luke Branson, Andrew M. Sutton

Proceedings of the FOGA '21: Foundations of Genetic Algorithms XVI, 2021

2020

Parameterized Complexity Analysis of Randomized Search Heuristics.

Frank Neumann, Andrew M. Sutton

Proceedings of the Theory of Evolutionary Computation, 2020

Theory of evolutionary computation - Special Issue Editorial.

Pietro S. Oliveto, Andrew M. Sutton

Theor. Comput. Sci., 2020

Parameterized Complexity Analysis of Randomized Search Heuristics.

Frank Neumann, Andrew M. Sutton

CoRR, 2020

Approximation Speed-Up by Quadratization on LeadingOnes.

Andrew M. Sutton, L. Darrell Whitley

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Understanding transforms of pseudo-boolean functions.

L. Darrell Whitley, Hernán E. Aguirre, Andrew M. Sutton

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Optimization of Chance-Constrained Submodular Functions.

Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton

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.

Thomas Bläsius, Tobias Friedrich, Andrew M. Sutton

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

When resampling to cope with noise, use median, not mean.

Benjamin Doerr, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem.

Frank Neumann, Andrew M. Sutton

Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

Evolving Solutions to Community-Structured Satisfiability Formulas.

Frank Neumann, Andrew M. Sutton

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Escaping Local Optima Using Crossover With Emergent Diversity.

Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton

IEEE Trans. Evol. Comput., 2018

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

Frank Neumann, Andrew M. Sutton

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Next generation genetic algorithms.

L. Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tinós

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Crossover can simulate bounded tree search on a fixed-parameter tractable optimization problem.

Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

On the runtime dynamics of the compact genetic algorithm on jump functions.

Václav Hasenöhrl, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences.

Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017

The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise.

Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton

IEEE Trans. Evol. Comput., 2017

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

Benjamin Doerr, Frank Neumann, Andrew M. Sutton

Algorithmica, 2017

Resampling vs Recombination: a Statistical Run Time Estimation.

Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton

Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT.

Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Phase Transitions for Scale-Free SAT Formulas.

Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton

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.

Mohsen Amini Salehi, Jay Smith, Anthony A. Maciejewski, Howard Jay Siegel, Edwin K. P. Chong, Jonathan Apodaca, Luis Diego Briceno, Timothy Renner, Vladimir Shestak, Joshua Ladd, Andrew M. Sutton, David L. Janovy, Sudha Govindasamy, Amin Alqudah, Rinku Dewri, Puneet Prakash

J. Parallel Distributed Comput., 2016

Robustness of Ant Colony Optimization to Noise.

Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton

Evol. Comput., 2016

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.

Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton

CoRR, 2016

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

Andrew M. Sutton

Algorithmica, 2016

On the Robustness of Evolving Populations.

Tobias Friedrich, Timo Kötzing, Andrew M. Sutton

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Graceful Scaling on Uniform Versus Steep-Tailed Noise.

Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms.

Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Ant Colony Optimization Beats Resampling on Noisy Functions.

Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Escaping Local Optima with Diversity Mechanisms and Crossover.

Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton

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.

Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann

Theor. Comput. Sci., 2015

Editorial for the Special Issue on Theory of Evolutionary Algorithms 2014.

Pietro S. Oliveto, Andrew M. Sutton

Evol. Comput., 2015

Fitness Probability Distribution of Bit-Flip Mutation.

Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley, Enrique Alba

Evol. Comput., 2015

The Benefit of Sex in Noisy Evolutionary Search.

Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton

CoRR, 2015

The Benefit of Recombination in Noisy Evolutionary Search.

Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton

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.

Benjamin Doerr, Frank Neumann, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014

The component model for elementary landscapes and partial neighborhoods.

L. Darrell Whitley, Andrew M. Sutton, Gabriela Ochoa, Francisco Chicano

Theor. Comput. Sci., 2014

The Max problem revisited: The importance of mutation in genetic programming.

Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly

Theor. Comput. Sci., 2014

Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem.

Andrew M. Sutton, Frank Neumann, Samadhi Nallaperuma

Evol. Comput., 2014

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

Andrew M. Sutton, Frank Neumann

Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Parameterized complexity analysis of evolutionary algorithms.

Frank Neumann, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Efficient identification of improving moves in a ball for pseudo-boolean problems.

Francisco Chicano, L. Darrell Whitley, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013

Emulating C++0x concepts.

Andrew M. Sutton, Jonathan I. Maletic

Sci. Comput. Program., 2013

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

Andrew M. Sutton

Genet. Program. Evolvable Mach., 2013

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

Andrew M. Sutton, Francisco Chicano, L. Darrell Whitley

Evol. Comput., 2013

Elementary landscapes: theory and applications.

L. Darrell Whitley, Andrew M. Sutton

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.

Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann

Proceedings of the IEEE Congress on Evolutionary Computation, 2013

Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem.

Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann

Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012

Genetic Algorithms - A Survey of Models and Methods.

L. Darrell Whitley, Andrew M. Sutton

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.

Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe

Theor. Comput. Sci., 2012

A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling.

Andrew M. Sutton, Frank Neumann

Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT.

Andrew M. Sutton, Jareth Day, Frank Neumann

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem.

Andrew M. Sutton, Frank Neumann

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

MosaiCode: Visualizing large scale software: A tool demonstration.

Jonathan I. Maletic, Daniel J. Mosora, Christian D. Newman, Michael L. Collard, Andrew M. Sutton, Brian P. Robinson

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.

Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Approximating the distribution of fitness over hamming regions.

Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe

Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

2010

Directed Plateau Search for MAX-k-SAT.

Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Identification of Idiom Usage in C++ Generic Libraries.

Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic

Proceedings of the 18th IEEE International Conference on Program Comprehension, 2010

2009

A Theoretical Analysis of the k-Satisfiability Search Space.

Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

Estimating Bounds on Expected Plateau Size in MAXSAT Problems.

Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

Improved Robustness through Population Variance in Ant Colony Optimization.

David C. Matthews, Andrew M. Sutton, Doug Hains, L. Darrell Whitley

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

Abstracting the template instantiation relation in C++.

Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic

Proceedings of the 25th IEEE International Conference on Software Maintenance (ICSM 2009), 2009

Elementary landscape analysis.

L. Darrell Whitley, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Partial neighborhoods of elementary landscapes.

L. Darrell Whitley, Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

A polynomial time computation of the exact correlation structure of k-satisfiability landscapes.

Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

2008

Resource Scheduling with Permutation Based Representations: Three Applications.

L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe, Laura Barbulescu

Proceedings of the Evolutionary Computation in Practice, 2008

The Impact of Global Structure on Search.

Monte Lunacek, L. Darrell Whitley, Andrew M. Sutton

Proceedings of the Parallel Problem Solving from Nature, 2008

Automatically identifying C++0x concepts in function templates.

Andrew M. Sutton, Jonathan I. Maletic

Proceedings of the 24th IEEE International Conference on Software Maintenance (ICSM 2008), September 28, 2008

Understanding elementary landscapes.

L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe

Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2007

Recovering UML class models from C++: A detailed explanation.

Andrew M. Sutton, Jonathan I. Maletic

Inf. Softw. Technol., 2007

Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment.

Jay Smith, Luis Diego Briceno, Anthony A. Maciejewski, Howard Jay Siegel, Timothy Renner, Vladimir Shestak, Joshua Ladd, Andrew M. Sutton, David L. Janovy, Sudha Govindasamy, Amin Alqudah, Rinku Dewri, Puneet Prakash

Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

How We Manage Portability and Configuration with the C Preprocessor.

Andrew M. Sutton, Jonathan I. Maletic

Proceedings of the 23rd IEEE International Conference on Software Maintenance (ICSM 2007), 2007

Differential evolution and non-separability: using selective pressure to focus search.

Andrew M. Sutton, Monte Lunacek, L. Darrell Whitley

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling.

Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley

Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

2006

PSO and multi-funnel landscapes: how cooperation might limit exploration.

Andrew M. Sutton, L. Darrell Whitley, Monte Lunacek, Adele E. Howe

Proceedings of the Genetic and Evolutionary Computation Conference, 2006

Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules.

Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley

Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

2005

Mappings for Accurately Reverse Engineering UML Class Models from C++.

Andrew M. Sutton, Jonathan I. Maletic

Proceedings of the 12th Working Conference on Reverse Engineering, 2005

Context-Free Slicing of UML Class Models.

Huzefa H. Kagdi, Jonathan I. Maletic, Andrew M. Sutton

Proceedings of the 21st IEEE International Conference on Software Maintenance (ICSM 2005), 2005

Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones.

Andrew M. Sutton, Huzefa H. Kagdi, Jonathan I. Maletic, L. Gwenn Volkert

Proceedings of the Genetic and Evolutionary Computation Conference, 2005