Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications of the Algorithm Engineering Group

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

Publications of Dr. Andrew M. Sutton

The following listing contains all publications of Dr. Andrew M. Sutton. Further publications of the research group can be found on the current list of publications and the complete list of publications. Individual listings are available externally on DBLP or locally as PDF.

[2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006]

2017 [ to top ]

  • Doerr, Benjamin; Neumann, Frank; Sutton, Andrew M. Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica 2017: 561-586
     
  • submission ESA 2017.pdf
    Friedrich, Tobias; Krohmer, Anton; Rothenberger, Ralf; Sauerwald, Thomas; Sutton, Andrew M. Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. European Symposium on Algorithms (ESA) 2017
     
  • p25-friedrich_foga17.pdf
    Friedrich, Tobias; Kötzing, Timo; Quinzan, Francesco; Sutton, Andrew Michael Resampling vs Recombination: a Statistical Run Time Estimation. Foundations of Genetic Algorithms (FOGA) 2017: 25-35
     
  • 0001KRS17.pdf
    Friedrich, Tobias; Krohmer, Anton; Rothenberger, Ralf; Sutton, Andrew M. Phase Transitions for Scale-Free SAT Formulas. Association for the Advancement of Artificial Intelligence (AAAI) 2017: 3893-3899
     
  • paper.pdf
    Dang, Duc-Cuong; Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Lehre, Per Kristian; Oliveto, Pietro S.; Sudholt, Dirk; Sutton, Andrew M. Escaping Local Optima Using Crossover with Emergent Diversity. IEEE Transactions on Evolutionary Computation 2017
     
  • cGA_with_noise.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Compact Genetic Algorithm is Efficient under Extreme Gaussian Noise. IEEE Transactions on Evolutionary Computation 2017: 477-490
     

2016 [ to top ]

  • EscapingLocalOptimaWithDiversityMechanismsAndCrossover.pdf
    Dang, Duc-Cuong; Friedrich, Tobias; Krejca, Martin S.; Kötzing, Timo; Lehre, Per Kristian; Oliveto, Pietro S.; Sudholt, Dirk; Sutton, Andrew Michael Escaping Local Optima with Diversity Mechanisms and Crossover. Genetic and Evolutionary Computation Conference (GECCO) 2016: 645-652
     
  • TheBenefitOfRecombinationInNoisyEvolutionarySearchGecco.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Benefit of Recombination in Noisy Evolutionary Search. Genetic and Evolutionary Computation Conference (GECCO) 2016: 161-162
     
  • AntColonyOptimizationBeatsResamplingOnNoisyFunctions.pdf
    Friedrich, Tobias; Kötzing, Timo; Quinzan, Francesco; Sutton, Andrew M. Ant Colony Optimization Beats Resampling on Noisy Functions. Genetic and Evolutionary Computation Conference (GECCO) 2016: 3-4
     
  • SuperpolynomialLowerBoundsForThe(1+1)EaOnSomeEasyCombinatorialProblems.pdf
    Sutton, Andrew M. Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems. Algorithmica 2016: 507-528
     
  • RobustnessOfAntColonyOptimizationToNoiseJournal.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Robustness of Ant Colony Optimization to Noise. Evolutionary Computation 2016: 237-254
     
  • Graceful.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Graceful Scaling on Uniform versus Steep-Tailed Noise. Parallel Problem Solving From Nature (PPSN) 2016: 761-770
     
  • EmergenceOfDiversityAndItsBenefitsForCrossoverInGeneticAlgorithms.pdf
    Dang, Duc-Cuong; Lehre, Per Kristian; Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Oliveto, Pietro S.; Sudholt, Dirk; Sutton, Andrew M. Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. Parallel Problem Solving From Nature (PPSN) 2016: 890-900
     
  • OnTheRobustnessOfEvolvingPopulations.pdf
    Friedrich, Tobias; Kötzing, Timo; Sutton, Andrew M. On the Robustness of Evolving Populations. Parallel Problem Solving From Nature (PPSN) 2016: 771-781
     

2015 [ to top ]

  • FitnessProbabilityDistributionOfBit-FlipMutation.pdf
    Chicano, Francisco; Sutton, Andrew M.; Whitley, L. Darrell; Alba, Enrique Fitness Probability Distribution of Bit-Flip Mutation. Evolutionary Computation 2015: 217-248
     
  • TheBenefitOfRecombinationInNoisyEvolutionarySearch.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Benefit of Recombination in Noisy Evolutionary Search. International Symposium of Algorithms and Computation (ISAAC) 2015: 140-150
     
  • TowardAUnifyingFrameworkForEvolutionaryProcesses.pdf
    Paixão, Tiago; Badkobeh, Golnaz; Barton, Nick H.; Çörüş, Doğan; Dang, Duc-Cuong; Friedrich, Tobias; Lehre, Per Kristian; Sudholt, Dirk; Sutton, Andrew; Trubenová, Barbora Toward a unifying framework for evolutionary processes. Journal of Theoretical Biology 2015: 28-43
     
  • ImprovedRuntimeBoundsForThe(1+1)EaOnRandom3-CnfFormulasBasedOnFitness-DistanceCorrelation.pdf
    Doerr, Benjamin; Neumann, Frank; Sutton, Andrew M. Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. Genetic and Evolutionary Computation Conference (GECCO) 2015: 1415-1422
     
  • RobustnessOfAntColonyOptimizationToNoise.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Robustness of Ant Colony Optimization to Noise. Genetic and Evolutionary Computation Conference (GECCO) 2015: 17-24
    Best Paper Award (ACO/SI Track)
     
  • PopulationSizeMattersRigorousRuntimeResultsForMaximizingTheHypervolumeIndicatorJournal.pdf
    Nguyen, Anh Quang; Sutton, Andrew M.; Neumann, Frank Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theoretical Computer Science 2015: 24-36
     

2014 [ to top ]

  • RuntimeAnalysisOfEvolutionaryAlgorithmsOnRandomlyConstructedHigh-DensitySatisfiable3-CnfFormulas.pdf
    Sutton, Andrew M.; Neumann, Frank Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. Parallel Problem Solving from Nature (PPSN) 2014: 942-951
     
  • ParameterizedRuntimeAnalysesOfEvolutionaryAlgorithmsForThePlanarEuclideanTravelingSalespersonProblem.pdf
    Sutton, Andrew M.; Neumann, Frank; Nallaperuma, Samadhi Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem. Evolutionary Computation 2014: 595-628
     
  • TheComponentModelForElementaryLandscapesAndPartialNeighborhoods.pdf
    Whitley, Darrell; Sutton, Andrew M.; Ochoa, Gabriela; Chicano, Francisco The component model for elementary landscapes and partial neighborhoods. Theoretical Computer Science 2014: 59-75
     
  • EfficientIdentificationOfImprovingMovesInABallForPseudo-BooleanProblems.pdf
    Chicano, Francisco; Whitley, Darrell; Sutton, Andrew M. Efficient identification of improving moves in a ball for pseudo-boolean problems. Genetic and Evolutionary Computation Conference (GECCO) 2014: 437-444
     

2013 [ to top ]

  • Fixed-ParameterEvolutionaryAlgorithmsForTheEuclideanTravelingSalespersonProblem.pdf
    Nallaperuma, Samadhi; Sutton, Andrew M.; Neumann, Frank Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. Congress on Evolutionary Computation (CEC) 2013: 2037-2044
     
  • NallaperumaSN13a.pdf
    Nallaperuma, Samadhi; Sutton, Andrew M.; Neumann, Frank Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. Congress on Evolutionary Computation (CEC) 2013: 2045-2052
     
  • FitnessFunctionDistributionsOverGeneralizedSearchNeighborhoodsInTheQ-AryHypercube.pdf
    Sutton, Andrew M.; Chicano, Francisco; Whitley, L. Darrell Fitness Function Distributions over Generalized Search Neighborhoods in the q-ary Hypercube. Evolutionary Computation 2013: 561-590
     

2012 [ to top ]

  • AParameterizedRuntimeAnalysisOfEvolutionaryAlgorithmsForMAX-2-SAT.pdf
    Sutton, Andrew M.; Day, Jareth; Neumann, Frank A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. Genetic and Evolutionary Computation Conference (GECCO) 2012: 433-440
     
  • AParameterizedRuntimeAnalysisOfEvolutionaryAlgorithmsForTheEuclideanTravelingSalespersonProblem.pdf
    Sutton, Andrew M.; Neumann, Frank A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. Conference on Artificial Intelligence (AAAI) 2012
     
  • WhitleyS12.pdf
    Whitley, Darrell; Sutton, Andrew M. Genetic Algorithms - A Survey of Models and Methods. Handbook of Natural Computing 2012: 637--671
     
  • ComputingTheMomentsOfK-BoundedPseudo-BooleanFunctionsOverHammingSpheresOfArbitraryRadiusInPolynomialTime.pdf
    Sutton, Andrew M.; Whitley, L. Darrell; Howe, Adele E. Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theoretical Computer Science 2012: 58-74
     
  • AParameterizedRuntimeAnalysisOfSimpleEvolutionaryAlgorithmsForMakespanScheduling.pdf
    Sutton, Andrew M.; Neumann, Frank A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. Parallel Problem Solving from Nature (PPSN) 2012: 52-61
     

2011 [ to top ]

  • ApproximatingTheDistributionOfFitnessOverHammingRegions.pdf
    Sutton, Andrew M.; Whitley, Darrell; Howe, Adele E. Approximating the distribution of fitness over hamming regions. Foundations of Genetic Algorithms (FOGA) 2011: 93-104
     
  • MutationRatesOfThe(1+1)-EaOnPseudo-BooleanFunctionsOfBoundedEpistasis.pdf
    Sutton, Andrew M.; Whitley, Darrell; Howe, Adele E. Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. Genetic and Evolutionary Computation Conference (GECCO) 2011: 973-980
     

2010 [ to top ]

  • DirectedPlateauSearchForMax-K-Sat.pdf
    Sutton, Andrew M.; Howe, Adele E.; Whitley, L. Darrell Directed Plateau Search for MAX-k-SAT. Symposium on Combinatorial Search (SOCS) 2010
     

2009 [ to top ]

  • ImprovedRobustnessThroughPopulationVarianceInAntColonyOptimization.pdf
    Matthews, David C.; Sutton, Andrew M.; Hains, Doug; Whitley, L. Darrell Improved Robustness through Population Variance in Ant Colony Optimization. Stochastic Local Search Algorithms (SLS) 2009: 145-149
     
  • ATheoreticalAnalysisOfTheK-SatisfiabilitySearchSpace.pdf
    Sutton, Andrew M.; Howe, Adele E.; Whitley, L. Darrell A Theoretical Analysis of the k-Satisfiability Search Space. Stochastic Local Search Algorithms (SLS) 2009: 46-60
     
  • PartialNeighborhoodsOfElementaryLandscapes.pdf
    Whitley, L. Darrell; Sutton, Andrew M. Partial neighborhoods of elementary landscapes. Genetic and Evolutionary Computation Conference (GECCO) 2009: 381-388
     
  • APolynomialTimeComputationOfTheExactCorrelationStructureOfK-SatisfiabilityLandscapes.pdf
    Sutton, Andrew M.; Whitley, L. Darrell; Howe, Adele E. A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. Genetic and Evolutionary Computation Conference (GECCO) 2009: 365-372
     
  • EstimatingBoundsOnExpectedPlateauSizeInMaxsatProblems.pdf
    Sutton, Andrew M.; Howe, Adele E.; Whitley, L. Darrell Estimating Bounds on Expected Plateau Size in MAXSAT Problems. Stochastic Local Search Algorithms (SLS) 2009: 31-45
     

2008 [ to top ]

  • ResourceSchedulingWithPermutationBasedRepresentations.pdf
    Whitley, Darrell; Sutton, Andrew M.; Howe, Adele E.; Barbulescu, Laura Resource Scheduling with Permutation Based Representations: Three Applications. Evolutionary Computation in Practice 2008: 219-243
     
  • TheImpactOfGlobalStructureOnSearch.pdf
    Lunacek, Monte; Whitley, Darrell; Sutton, Andrew M. The Impact of Global Structure on Search. Parallel Problem Solving from Nature (PPSN) 2008: 498-507
     
  • UnderstandingElementaryLandscapes.pdf
    Whitley, Darrell; Sutton, Andrew M.; Howe, Adele E. Understanding elementary landscapes. Genetic and Evolutionary Computation Conference (GECCO) 2008: 585-592
     

2007 [ to top ]

  • UsingAdaptivePriorityWeightingToDirectSearchInProbabilisticScheduling.pdf
    Sutton, Andrew M.; Howe, Adele E.; Whitley, L. Darrell Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling. International Conference on Automated Planning and Scheduling (ICAPS) 2007: 320-327
     
  • MeasuringTheRobustnessOfResourceAllocationsInAStochasticDynamicEnvironment.pdf
    Smith, Jay; Briceno, Luis Diego; Maciejewski, Anthony A.; Siegel, Howard Jay; Renner, Timothy; Shestak, Vladimir; Ladd, Joshua; Sutton, Andrew M.; Janovy, David L.; Govindasamy, Sudha; Alqudah, Amin; Dewri, Rinku; Prakash, Puneet Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment. International Parallel and Distributed Processing Symposium (IPDPS) 2007: 1-10
     
  • DifferentialEvolutionAndNon-SeparabilityUsingSelectivePressureToFocusSearch.pdf
    Sutton, Andrew M.; Lunacek, Monte; Whitley, L. Darrell Differential evolution and non-separability: using selective pressure to focus search. Genetic and Evolutionary Computation Conference (GECCO) 2007: 1428-1435
     

2006 [ to top ]

  • SpacetrackTradingOffQualityAndUtilizationInOversubscribedSchedules.pdf
    Sutton, Andrew M.; Howe, Adele E.; Whitley, L. Darrell Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules. International Conference on Automated Planning and Scheduling (ICAPS) 2006: 430-433
     
  • PsoAndMulti-FunnelLandscapesHowCooperationMightLimitExploration.pdf
    Sutton, Andrew M.; Whitley, Darrell; Lunacek, Monte; Howe, Adele E. PSO and multi-funnel landscapes: how cooperation might limit exploration. Genetic and Evolutionary Computation Conference (GECCO) 2006: 75-82