Items where authors include "Sudholt, D."

Article

Hevia Fajardo, M.A. orcid.org/0000-0003-3529-0434 and Sudholt, D. orcid.org/0000-0001-6020-1646 (2023) Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. Algorithmica, 86 (2). pp. 526-565. ISSN 0178-4617

Oliveto, P.S., Sudholt, D. and Witt, C. (2022) Tight bounds on the expected runtime of a standard steady state genetic algorithm. Algorithmica, 84 (6). pp. 1603-1658. ISSN 0178-4617

Hall, G.T., Oliveto, P.S. and Sudholt, D. (2022) On the impact of the performance metric on efficient algorithm configuration. Artificial Intelligence, 303. 103629. ISSN 0004-3702

Bossek, J., Neumann, F., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2021) Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem. Algorithmica, 83. pp. 3148-3179. ISSN 0178-4617

Sudholt, D. orcid.org/0000-0001-6020-1646 (2021) Analysing the robustness of evolutionary algorithms to noise : refined runtime bounds and an example where noise is beneficial. Algorithmica, 83 (4). pp. 976-1011. ISSN 0178-4617

Lehre, P.K. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2020) Parallel black-box complexity with tail bounds. IEEE Transactions on Evolutionary Computation, 24 (6). pp. 1010-1024. ISSN 1089-778X

Nguyen, P.T.H. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2020) Memetic algorithms outperform evolutionary algorithms in multimodal optimisation. Artificial Intelligence, 287. 103345. ISSN 0004-3702

Covantes Osuna, E. orcid.org/0000-0001-5991-6927, Gao, W., Neumann, F. et al. (1 more author) (2020) Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation. Theoretical Computer Science, 832. pp. 123-142. ISSN 0304-3975

Covantes Osuna, E. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2020) Runtime analysis of crowding mechanisms for multimodal optimisation. IEEE Transactions on Evolutionary Computation, 24 (3). pp. 581-592. ISSN 1089-778X

Covantes Osuna, E. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2019) On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism. Evolutionary Computation, 27 (3). pp. 403-433. ISSN 1063-6560

Oliveto, P.S., Sudholt, D. orcid.org/0000-0001-6020-1646 and Zarges, C. (2019) On the benefits and risks of using fitness sharing for multimodal optimisation. Theoretical Computer Science, 773. pp. 53-70. ISSN 0304-3975

Sudholt, D. orcid.org/0000-0001-6020-1646 and Witt, C. (2019) On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization. Algorithmica, 81 (4). pp. 1450-1489. ISSN 0178-4617

Nallaperuma, S., Oliveto, P.S., Perez Heredia, J. et al. (1 more author) (2019) On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements? Algorithmica, 81 (2). pp. 858-885. ISSN 0178-4617

Dang, D.C., Friedrich, T., Kötzing, T. et al. (5 more authors) (2018) Escaping Local Optima Using Crossover with Emergent Diversity. IEEE Transactions on Evolutionary Computation, 22 (3). pp. 484-497. ISSN 1089-778X

Oliveto, P.S., Paixão, T., Pérez Heredia, J. et al. (2 more authors) (2018) How to escape local optima in black box optimisation: when non-elitism outperforms elitism. Algorithmica, 80 (5). pp. 1604-1633. ISSN 0178-4617

Sudholt, D. (2017) How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms. Evolutionary Computation, 25 (2). pp. 237-274. ISSN 1530-9304

Corus, D., He, J., Jansen, T. et al. (3 more authors) (2017) On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica, 78 (2). pp. 714-740. ISSN 0178-4617

Paixao, T., Perez Heredia, J., Sudholt, D. orcid.org/0000-0001-6020-1646 et al. (1 more author) (2017) Towards a Runtime Comparison of Natural and Artificial Evolution. Algorithmica, 78 (2). pp. 681-713. ISSN 1432-0541

Perez Heredia, J., Trubenova, B., Sudholt, D. orcid.org/0000-0001-6020-1646 et al. (1 more author) (2017) Selection limits to adaptive walks on correlated landscapes. Genetics, 205 (2). pp. 803-825. ISSN 1943-2631

Nallaperuma, S., Neumann, F. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2016) Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem. Evolutionary Computation. ISSN 1063-6560

Mambrini, A. and Sudholt, D. (2015) Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms. Evolutionary Computation, 23 (4). pp. 559-582. ISSN 1530-9304

Kempka, J., McMinn, P. and Sudholt, D. (2015) Design and analysis of different alternating variable searches for search-based software testing. Theoretical Computer Science, 605. pp. 1-20. ISSN 0304-3975

Paixão, T., Badkobeh, G., Barton, N. et al. (7 more authors) (2015) Toward a unifying framework for evolutionary processes. Journal of Theoretical Biology, 383. 28 - 43. ISSN 0022-5193

Moraglio, A. and Sudholt, D. (2015) Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search. Evolutionary Computation. ISSN 1063-6560

Lässig, J. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2014) General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms. Evolutionary Computation, 22 (3). pp. 405-437. ISSN 1063-6560

Proceedings Paper

Hall, G.T., Oliveto, P.S. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2020) Fast perturbative algorithm configurators. In: Bäck, T., Preuss, M., Deutz, A., Wang, H., Doerr, C. and Emm, M., (eds.) Parallel Problem Solving from Nature – PPSN XVI. International Conference on Parallel Problem Solving from Nature (PPSN 2020), 05-09 Sep 2020, Leiden, Netherlands. Lecture Notes in Computer Science, 12269 . Springer , pp. 19-32. ISBN 9783030581114

Hall, G.T., Oliveto, P.S. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2020) Analysis of the performance of algorithm configurators for search heuristics with global mutation operators. In: Coello Coello, C.A., (ed.) GECCO 2020: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO '20: Genetic and Evolutionary Computation Conference, 08-12 Jul 2020, Cancún Mexico (Online). ACM Digital Library , pp. 823-831. ISBN 9781450371285

Oliveto, P.S., Sudholt, D. orcid.org/0000-0001-6020-1646 and Witt, C. (2020) A tight lower bound on the expected runtime of standard steady state genetic algorithms. In: GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference. GECCO '20: Genetic and Evolutionary Computation Conference, 08-12 Jul 2020, Online conference. ACM Digital Library , pp. 1323-1331. ISBN 9781450371285

Albunian, N., Fraser, G. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2020) Causes and effects of fitness landscapes in unit test generation. In: GECCO 2020: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2020 : Genetic and Evolutionary Computation Conference, 08-12 Jul 2020, Cancún, Mexico. ACM Digital Library , pp. 1204-1212. ISBN 9781450371285

Foster, M., Hughes, M., O'Brien, G. et al. (4 more authors) (2020) Do sophisticated evolutionary algorithms perform better than simple ones? In: GECCO 2020: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2020 : Genetic and Evolutionary Computation Conference, 08-12 Jul 2020, Cancún, Mexico. ACM Digital Library , pp. 184-192. ISBN 9781450371285

Bossek, J., Neumann, F., Peng, P. et al. (1 more author) (2020) More effective randomized search heuristics for graph coloring through dynamic optimization. In: GECCO 2020: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2020 : Genetic and Evolutionary Computation Conference, 08-12 Jul 2020, Cancún, Mexico. ACM Digital Library , pp. 1277-1285. ISBN 9781450371285

Hevia Fajardo, M.A. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2020) On the choice of the parameter control mechanism in the (1+(λ, λ)) genetic algorithm. In: GECCO 2020: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2020 : Genetic and Evolutionary Computation Conference, 08-12 Jul 2020, Cancún, Mexico. ACM Digital Library , pp. 832-840. ISBN 9781450371285

Bossek, J. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2019) Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem. In: FOGA '19- Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 27-29 Aug 2019, Potsdam, Germany. ACM Digital Library . ISBN 9781450362542

Hall, G.T., Oliveto, P. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2019) On the impact of the cutoff time on the performance of algorithm configurators. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2019). Genetic and Evolutionary Computation Conference (GECCO 2019), 13-17 Jul 2019, Prague, Czech Republic. ACM , pp. 907-915. ISBN 9781450361118

Bossek, J., Neumann, F., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2019) Runtime analysis of randomized search heuristics for dynamic graph coloring. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 19). Genetic and Evolutionary Computation Conference (GECCO '19), 13-17 Jul 2019, Prague, Czech Republic. ACM , pp. 1443-1451. ISBN 9781450361118

Covantes Osuna, E. orcid.org/0000-0001-5991-6927 and Sudholt, D. orcid.org/0000-0001-6020-1646 (2018) Empirical analysis of diversity-preserving mechanisms on example landscapes for multimodal optimisation. In: Auger, A., Fonseca, C., Lourenço, N., Machado, P., Paquete, L. and Whitley, D., (eds.) Parallel Problem Solving from Nature – PPSN XV. PPSN 2018: 15th International Conference on Parallel Problem Solving from Nature, 08-12 Sep 2018, Coimbra, Portugal. Lecture Notes in Computer Science, 11102 . Springer Verlag , pp. 207-219. ISBN 9783319992587

Lengler, J., Sudholt, D. orcid.org/0000-0001-6020-1646 and Witt, C. (2018) Medium step sizes are harmful for the compact genetic algorithm. In: Aquirre, H., (ed.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2018). Genetic and Evolutionary Computation Conference (GECCO 2018), 15-19 Jul 2018, Kyoto, Japan. ACM , pp. 1499-1506. ISBN 978-1-4503-5618-3

Nguyen, P.T.H. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2018) Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2018). Genetic and Evolutionary Computation Conference (GECCO 2018), 15-19 Jul 2018, Kyoto, Japan. ACM . ISBN 978-1-4503-5618-3

Sudholt, D. orcid.org/0000-0001-6020-1646 (2018) On the Robustness of Evolutionary Algorithms to Noise: Refined Results and an Example Where Noise Helps. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2018). Genetic and Evolutionary Computation Conference (GECCO 2018), 15-19 Jul 2018, Kyoto, Japan. ACM . ISBN 978-1-4503-5618-3

Covantes Osuna, E. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2018) Runtime Analysis of Probabilistic Crowding and Restricted Tournament Selection for Bimodal Optimisation. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2018). Genetic and Evolutionary Computation Conference (GECCO 2018), 15-19 Jul 2018, Kyoto, Japan. ACM . ISBN 978-1-4503-5618-3

Covantes Osuna, E., Gao, W., Neumann, F. et al. (1 more author) (2017) Speeding Up Evolutionary Multi-objective Optimisation Through Diversity-Based Parent Selection. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 17). Genetic and Evolutionary Computation Conference (GECCO 2017), 15/07/2017 - 19/07/2017, Berlin. ACM , pp. 553-560.

Lissovoi, A., Sudholt, D. orcid.org/0000-0001-6020-1646, Wagner, M. et al. (1 more author) (2017) Theoretical results on bet-and-run as an initialisation strategy. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2017). Genetic and Evolutionary Computation Conference (GECCO 2017), 15/07/2017 - 19/07/2017, Berlin. ACM , pp. 857-864.

Nallaperuma, S., Oliveto, P.S., Perez Heredia, J. et al. (1 more author) (2017) When is it Beneficial to Reject Improvements? In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 17). Genetic and Evolutionary Computation Conference (GECCO 17), 15/07/2017 - 19/07/2017, Berlin. ACM , pp. 1391-1398.

Covantes Osuna, E. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2017) Analysis of the Clearing Diversity-Preserving Mechanism. In: FOGA '17 Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA '17), 12-15 Jan 2017, Copenhagen, Denmark. Association for Computing Machinery . ISBN 978-1-4503-4651-1

Dang, D., Friedrich, T., Kötzing, T. et al. (5 more authors) (2016) Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. In: Parallel Problem Solving from Nature – PPSN XIV. Parallel Problem Solving from Nature (PPSN 2016), 17-21 Sep 2016, Edinburgh, UK. Lecture Notes in Computer Science, 9921 . Springer International Publishing .

Sudholt, D. orcid.org/0000-0001-6020-1646, Perez Heredia, J., Paixao, T. et al. (2 more authors) (2016) When Non-Elitism Outperforms Elitism for Crossing Fitness Valleys. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016. Genetic and Evolutionary Computation Conference (GECCO 2016), 20-24 Jul 2016, Denver, Colorado, USA. ACM , pp. 1163-1170. ISBN 978-1-4503-4206-3