Author of the publication

Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax.

, and . FOGA, page 65-79. ACM, (2017)

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.

 

Other publications of authors with the same name

Polymer dynamics via cliques: New conditions for approximations., , , and . Theor. Comput. Sci., (2023)Routing for on-street parking search using probabilistic data., , , , , , , and . AI Commun., 32 (2): 113-124 (2019)Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials., , , , and . CoRR, (2022)Lasting Diversity and Superior Runtime Guarantees for the (μ+1) Genetic Algorithm., , , and . CoRR, (2023)The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs., , , and . CoRR, (2021)Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation., , , , and . ICONIP (3), volume 12534 of Lecture Notes in Computer Science, page 592-604. Springer, (2020)Escaping Local Optima Using Crossover with Emergent Diversity, , , , , , , and . IEEE Transactions on Evolutionary Computation, (August 2017)Significance-based estimation-of-distribution algorithms., and . GECCO, page 1483-1490. ACM, (2018)Run Time Analysis for Random Local Search on Generalized Majority Functions., and . IEEE Trans. Evol. Comput., 27 (5): 1385-1397 (October 2023)The Impact of Geometry on Monochrome Regions in the Flip Schelling Process., , , and . ISAAC, volume 212 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)