Author of the publication

Per-run Algorithm Selection with Warm-Starting Using Trajectory-Based Features.

, , , , , , and . PPSN (1), volume 13398 of Lecture Notes in Computer Science, page 46-60. Springer, (2022)

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

The unbiased black-box complexity of partition is polynomial., , and . Artif. Intell., (2014)The Impact of Random Initialization on the Runtime of Randomized Search Heuristics., and . Algorithmica, 75 (3): 529-553 (2016)Complexity Theory for Discrete Black-Box Optimization Heuristics.. CoRR, (2018)Compiling a benchmarking test-suite for combinatorial black-box optimization: a position paper., , and . GECCO (Companion), page 1753-1760. ACM, (2018)Optimal Parameter Choices via Precise Black-Box Analysis., , and . GECCO, page 1123-1130. ACM, (2016)The Right Mutation Strength for Multi-Valued Decision Variables., , and . GECCO, page 1115-1122. ACM, (2016)Black-Box Optimization Revisited: Improving Algorithm Selection Wizards Through Massive Benchmarking., , , , , , , and . IEEE Trans. Evol. Comput., 26 (3): 490-500 (2022)Maximizing drift is not optimal for solving OneMax., and . GECCO (Companion), page 425-426. ACM, (2019)Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms?, and . CoRR, (2015)Sensitivity of Parameter Control Mechanisms with Respect to Their Initialization., and . PPSN (2), volume 11102 of Lecture Notes in Computer Science, page 360-372. Springer, (2018)