Items where authors include "Witt, C."

Article

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

Corus, D., Lissovoi, A., Oliveto, P. et al. (1 more author) (2021) On steady-state evolutionary algorithms and selective pressure: Why inverse rank-based allocation of reproductive trials is best. ACM Transactions on Evolutionary Learning and Optimization, 1 (1). 2. ISSN 2688-299X

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

Lissovoi, A. and Witt, C. (2018) The Impact of a sparse migration topology on the runtime of island models in dynamic optimization. Algorithmica, 80 (5). pp. 1634-1657. ISSN 0178-4617

Lissovoi, A. and Witt, C. (2017) A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization. Algorithmica, 78 (2). pp. 641-659. ISSN 0178-4617

Proceedings Paper

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

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