Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAndrew M. Sutton
Person information
- affiliation: University of Potsdam, HPI, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j17]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima Using Crossover With Emergent Diversity. IEEE Trans. Evolutionary Computation 22(3): 484-497 (2018)- [c55]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. GECCO 2018: 301-308 - [c54]Václav Hasenöhrl, Andrew M. Sutton:
On the runtime dynamics of the compact genetic algorithm on jump functions. GECCO 2018: 967-974 - [c53]Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tinós:
Next generation genetic algorithms. GECCO (Companion) 2018: 1039-1059 - [c52]Andrew M. Sutton:
Crossover can simulate bounded tree search on a fixed-parameter tractable optimization problem. GECCO 2018: 1531-1538 - [c51]Frank Neumann, Andrew M. Sutton:
Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. PPSN (2) 2018: 141-152 - 2017
- [j16]Benjamin Doerr, Frank Neumann, Andrew M. Sutton:
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica 78(2): 561-586 (2017) - [j15]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. IEEE Trans. Evolutionary Computation 21(3): 477-490 (2017) - [c50]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton:
Phase Transitions for Scale-Free SAT Formulas. AAAI 2017: 3893-3899 - [c49]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA 2017: 37:1-37:15 - [c48]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Resampling vs Recombination: a Statistical Run Time Estimation. FOGA 2017: 25-35 - [i5]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR abs/1706.08431 (2017) - 2016
- [j14]Andrew M. Sutton:
Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems. Algorithmica 75(3): 507-528 (2016) - [j13]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Robustness of Ant Colony Optimization to Noise. Evolutionary Computation 24(2): 237-254 (2016) - [j12]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:
Stochastic-based robust dynamic resource allocation for independent tasks in a heterogeneous computing system. J. Parallel Distrib. Comput. 97: 96-111 (2016) - [c47]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Ant Colony Optimization Beats Resampling on Noisy Functions. GECCO (Companion) 2016: 3-4 - [c46]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Recombination in Noisy Evolutionary Search. GECCO (Companion) 2016: 161-162 - [c45]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima with Diversity Mechanisms and Crossover. GECCO 2016: 645-652 - [c44]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Graceful Scaling on Uniform Versus Steep-Tailed Noise. PPSN 2016: 761-770 - [c43]Tobias Friedrich, Timo Kötzing, Andrew M. Sutton:
On the Robustness of Evolving Populations. PPSN 2016: 771-781 - [c42]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, Andrew M. Sutton:
Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. PPSN 2016: 890-900 - [e2]Tobias Friedrich, Frank Neumann, Andrew M. Sutton:
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016. ACM 2016, ISBN 978-1-4503-4206-3 [contents] - [e1]Tobias Friedrich, Frank Neumann, Andrew M. Sutton:
Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings. ACM 2016, ISBN 978-1-4503-4323-7 [contents] - [i4]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. CoRR abs/1608.03123 (2016) - 2015
- [j11]Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley, Enrique Alba:
Fitness Probability Distribution of Bit-Flip Mutation. Evolutionary Computation 23(2): 217-248 (2015) - [j10]Pietro Simone Oliveto, Andrew M. Sutton:
Editorial for the Special Issue on Theory of Evolutionary Algorithms 2014. Evolutionary Computation 23(4): 509-511 (2015) - [j9]Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann:
Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theor. Comput. Sci. 561: 24-36 (2015) - [c41]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Robustness of Ant Colony Optimization to Noise. GECCO 2015: 17-24 - [c40]Frank Neumann, Andrew M. Sutton:
Parameterized Complexity Analysis of Evolutionary Algorithms. GECCO (Companion) 2015: 435-450 - [c39]Benjamin Doerr, Frank Neumann, Andrew M. Sutton:
Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. GECCO 2015: 1415-1422 - [c38]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Recombination in Noisy Evolutionary Search. ISAAC 2015: 140-150 - [i3]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Sex in Noisy Evolutionary Search. CoRR abs/1502.02793 (2015) - 2014
- [j8]Andrew M. Sutton, Frank Neumann, Samadhi Nallaperuma:
Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem. Evolutionary Computation 22(4): 595-628 (2014) - [j7]Darrell Whitley, Andrew M. Sutton, Gabriela Ochoa, Francisco Chicano:
The component model for elementary landscapes and partial neighborhoods. Theor. Comput. Sci. 545: 59-75 (2014) - [j6]Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly:
The Max problem revisited: The importance of mutation in genetic programming. Theor. Comput. Sci. 545: 94-107 (2014) - [c37]Francisco Chicano, Darrell Whitley, Andrew M. Sutton:
Efficient identification of improving moves in a ball for pseudo-boolean problems. GECCO 2014: 437-444 - [c36]Frank Neumann, Andrew M. Sutton:
Parameterized complexity analysis of evolutionary algorithms. GECCO (Companion) 2014: 607-622 - [c35]Andrew M. Sutton:
Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems. GECCO 2014: 1431-1438 - [c34]Andrew M. Sutton, Frank Neumann:
Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. PPSN 2014: 942-951 - 2013
- [j5]Andrew M. Sutton, Francisco Chicano, L. Darrell Whitley:
Fitness Function Distributions over Generalized Search Neighborhoods in the q-ary Hypercube. Evolutionary Computation 21(4): 561-590 (2013) - [j4]Andrew M. Sutton:
Thomas Jansen: Analyzing Evolutionary Algorithms: The Computer Science Perspective - Springer, 2013, 255 pp, ISBN: 978-3-642-17338-7. Genetic Programming and Evolvable Machines 14(4): 473-475 (2013) - [j3]Andrew M. Sutton, Jonathan I. Maletic:
Emulating C++0x concepts. Sci. Comput. Program. 78(9): 1449-1469 (2013) - [c33]Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann:
Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. IEEE Congress on Evolutionary Computation 2013: 2037-2044 - [c32]Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann:
Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. IEEE Congress on Evolutionary Computation 2013: 2045-2052 - [c31]L. Darrell Whitley, Andrew M. Sutton:
Elementary landscapes: theory and applications. GECCO (Companion) 2013: 545-566 - [c30]Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann:
Population size matters: rigorous runtime results for maximizing the hypervolume indicator. GECCO 2013: 1613-1620 - [i2]Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley, Enrique Alba:
Fitness Probability Distribution of Bit-Flip Mutation. CoRR abs/1309.2979 (2013) - 2012
- [j2]Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe:
Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theor. Comput. Sci. 425: 58-74 (2012) - [c29]Andrew M. Sutton, Frank Neumann:
A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. AAAI 2012 - [c28]Andrew M. Sutton, Jareth Day, Frank Neumann:
A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. GECCO 2012: 433-440 - [c27]L. Darrell Whitley, Andrew M. Sutton:
Elementary landscapes: theory and applications. GECCO (Companion) 2012: 941-960 - [c26]Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly:
The max problem revisited: the importance of mutation in genetic programming. GECCO 2012: 1333-1340 - [c25]Andrew M. Sutton, Frank Neumann:
A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. PPSN (1) 2012: 52-61 - [p2]Darrell Whitley, Andrew M. Sutton:
Genetic Algorithms - A Survey of Models and Methods. Handbook of Natural Computing 2012: 637-671 - [i1]Andrew M. Sutton, Frank Neumann:
A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. CoRR abs/1207.0578 (2012) - 2011
- [c24]Andrew M. Sutton, Darrell Whitley, Adele E. Howe:
Approximating the distribution of fitness over hamming regions. FOGA 2011: 93-104 - [c23]Andrew M. Sutton, Darrell Whitley, Adele E. Howe:
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. GECCO 2011: 973-980 - [c22]Jonathan I. Maletic, Daniel J. Mosora, Christian D. Newman, Michael L. Collard, Andrew M. Sutton, Brian P. Robinson:
MosaiCode: Visualizing large scale software: A tool demonstration. VISSOFT 2011: 1-4 - 2010
- [c21]Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic:
Identification of Idiom Usage in C++ Generic Libraries. ICPC 2010: 160-169 - [c20]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Directed Plateau Search for MAX-k-SAT. SOCS 2010
2000 – 2009
- 2009
- [c19]Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe:
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. GECCO 2009: 365-372 - [c18]L. Darrell Whitley, Andrew M. Sutton:
Partial neighborhoods of elementary landscapes. GECCO 2009: 381-388 - [c17]L. Darrell Whitley, Andrew M. Sutton:
Elementary landscape analysis. GECCO (Companion) 2009: 3227-3236 - [c16]Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic:
Abstracting the template instantiation relation in C++. ICSM 2009: 559-562 - [c15]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Estimating Bounds on Expected Plateau Size in MAXSAT Problems. SLS 2009: 31-45 - [c14]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
A Theoretical Analysis of the k-Satisfiability Search Space. SLS 2009: 46-60 - [c13]David C. Matthews, Andrew M. Sutton, Doug Hains, L. Darrell Whitley:
Improved Robustness through Population Variance in Ant Colony Optimization. SLS 2009: 145-149 - 2008
- [c12]Darrell Whitley, Andrew M. Sutton, Adele E. Howe:
Understanding elementary landscapes. GECCO 2008: 585-592 - [c11]Andrew M. Sutton, Jonathan I. Maletic:
Automatically identifying C++0x concepts in function templates. ICSM 2008: 57-66 - [c10]Monte Lunacek, Darrell Whitley, Andrew M. Sutton:
The Impact of Global Structure on Search. PPSN 2008: 498-507 - [p1]Darrell Whitley, Andrew M. Sutton, Adele E. Howe, Laura Barbulescu:
Resource Scheduling with Permutation Based Representations: Three Applications. Evolutionary Computation in Practice 2008: 219-243 - 2007
- [j1]Andrew M. Sutton, Jonathan I. Maletic:
Recovering UML class models from C++: A detailed explanation. Information & Software Technology 49(3): 212-229 (2007) - [c9]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling. ICAPS 2007: 320-327 - [c8]Andrew M. Sutton, Monte Lunacek, L. Darrell Whitley:
Differential evolution and non-separability: using selective pressure to focus search. GECCO 2007: 1428-1435 - [c7]Andrew M. Sutton, Jonathan I. Maletic:
How We Manage Portability and Configuration with the C Preprocessor. ICSM 2007: 275-284 - [c6]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:
Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment. IPDPS 2007: 1-10 - 2006
- [c5]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules. ICAPS 2006: 430-433 - [c4]Andrew M. Sutton, Darrell Whitley, Monte Lunacek, Adele E. Howe:
PSO and multi-funnel landscapes: how cooperation might limit exploration. GECCO 2006: 75-82 - 2005
- [c3]Andrew M. Sutton, Huzefa H. Kagdi, Jonathan I. Maletic, L. Gwenn Volkert:
Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones. GECCO 2005: 1079-1080 - [c2]Huzefa H. Kagdi, Jonathan I. Maletic, Andrew M. Sutton:
Context-Free Slicing of UML Class Models. ICSM 2005: 635-638 - [c1]Andrew M. Sutton, Jonathan I. Maletic:
Mappings for Accurately Reverse Engineering UML Class Models from C++. WCRE 2005: 175-184
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-11 22:22 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
