1. Adelaide Research & Scholarship

Search


Current filters:


Start a new search
Add filters:

Use filters to refine the search results.

 | 
Results 1-10 of 12 (Search time: 0.002 seconds).
Item hits:
PreviewIssue DateTitleAuthor(s)
2018Runtime analysis of evolutionary algorithms for the knapsack problem with favorably correlated weightsNeumann, F.; Sutton, A.; Auger, A.; Fonseca, C.; Lourenco, N.; Machado, P.; Paquete, L.; Whitley, D.; International Conference on Parallel Problem Solving from Nature (PPSN) (8 Sep 2018 - 12 Sep 2018 : Coimbra, Portugal)
2012A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problemSutton, A.; Neumann, F.; AAAI Conference on Artificial Intelligence (26th : 2012 : Toronto, Canada)
2014Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulasSutton, A.; Neumann, F.; BartzBeielstein, T.; Branke, J.; Filipic, B.; Smith, J.; 13th International Conference on Parallel Problem Solving from Nature (PPSN XIII) (13 Sep 2014 - 17 Sep 2014 : Ljubljana, Slovenia)
2015Improved runtime bounds for the (1+1) EA on random 3-CNF formulas based on fitness-distance correlationDoerr, B.; Neumann, F.; Sutton, A.; Silva, S.; 2015 Genetic and Evolutionary Computation Conference (GECCO 2015) (11 Jul 2015 - 15 Jul 2015 : Madrid, Spain)
2015Population size matters: rigorous runtime results for maximizing the hypervolume indicatorNguyen, A.; Sutton, A.; Neumann, F.
2017Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF FormulasDoerr, B.; Neumann, F.; Sutton, A.
2013Population size matters: rigorous runtime results for maximizing the hypervolume indicatorNguyen, A.; Sutton, A.; Neumann, F.; Blum, C.; Conference on Genetic and Evolutionary Computation (15th : 2013 : Amsterdam)
2013Parameterized complexity analysis and more effective construction methods for ACO algorithms and the Euclidean traveling salesperson problemNallaperuma, S.; Sutton, A.; Neumann, F.; IEEE Congress on Evolutionary Computation (2013 : Cancun, Mexico)
2013Fixed-parameter evolutionary algorithms for the euclidean traveling salesperson problemNallaperuma, S.; Sutton, A.; Neumann, F.; IEEE Congress on Evolutionary Computation (2013 : Cancun, Mexico)
2012A parameterized runtime analysis of simple evolutionary algorithms for makespan schedulingSutton, A.; Neumann, F.; Coello, C.A.C.; Cutello, V.; Deb, K.; Forrest, S.; Nicosia, G.; Pavone, M.; International Conference on Parallel Problem Solving from Nature (12th : 2012 : Taormina, Italy)

Discover