( en | de | ru )

 

Disambiguation of "Witt, Carsten"

Author of the publication

copydeleteadd this publication to your clipboard
First Steps Towards a Runtime Analysis of Neuroevolution.

, , and . FOGA, page 61-72. ACM, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Carsten Witt

Carsten Witt

Carsten Witt

Carsten Witt

Carsten Witt

 

Other publications of authors with the same name

Bioinspired Computation in Combinatorial Optimization, and . Natural Computing Series Springer, (2010)On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics., and . Comb. Probab. Comput., 14 (1-2): 225-247 (2005)Theory of estimation-of-distribution algorithms.. GECCO (Companion), page 1197-1225. ACM, (2019)Improved Fixed-Budget Results via Drift Analysis., and . PPSN (2), volume 12270 of Lecture Notes in Computer Science, page 648-660. Springer, (2020)How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys.. Theor. Comput. Sci., 940 (Part): 18-42 (2023)Optimal Mutation Rates for the (1+λ) EA on OneMax Through Asymptotically Tight Drift Analysis., and . Algorithmica, 80 (5): 1710-1731 (2018)Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem., , and . Algorithmica, 86 (1): 64-89 (January 2024)Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions., and . PPSN (2), volume 13399 of Lecture Notes in Computer Science, page 542-554. Springer, (2022)The compact genetic algorithm struggles on Cliff functions., , and . GECCO, page 1426-1433. ACM, (2022)Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem., , and . GECCO, page 1381-1389. ACM, (2022)