The following pages link to Carola Winzen (Q428905):
Displayed 14 items.
- Non-existence of linear universal drift functions (Q428906) (← links)
- Ranking-based black-box complexity (Q528852) (← links)
- Memory-restricted black-box complexity of OneMax (Q763484) (← links)
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems (Q1023397) (← links)
- Black-box complexities of combinatorial problems (Q1935820) (← links)
- Multiplicative drift analysis (Q1945169) (← links)
- Reducing the arity in unbiased black-box complexity (Q2251000) (← links)
- Playing mastermind with constant-size memory (Q2254508) (← links)
- Direction-reversing quasi-random rumor spreading with restarts (Q2445336) (← links)
- A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting (Q2903013) (← links)
- Playing Mastermind with Constant-size Memory (Q2904783) (← links)
- Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity (Q3007613) (← links)
- Playing Mastermind With Many Colors (Q3177818) (← links)
- Faster black-box algorithms through higher arity operators (Q5276095) (← links)