3 papers
cs.NE2023
Run Time Bounds for Integer-Valued OneMax Functions
Jonathan Gadea Harder, Timo Kötzing, Xiaoyue Li +1
While most theoretical run time analyses of discrete randomized search heuristics focused on finite search spaces, we consider the search space . This is a further ge…
cs.NE2023
Analysis of the (1+1) EA on LeadingOnes with Constraints
Tobias Friedrich, Timo Kötzing, Aneta Neumann +2
Understanding how evolutionary algorithms perform on constrained problems has gained increasing attention in recent years. In this paper, we study how evolutionary algorithms optim…
cs.NE2022
Theoretical Study of Optimizing Rugged Landscapes with the cGA
Tobias Friedrich, Timo Kötzing, Frank Neumann +1
Estimation of distribution algorithms (EDAs) provide a distribution - based approach for optimization which adapts its probability distribution during the run of the algorithm. We…