The following pages link to Carola Doerr (Q287983):
Displayed 26 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- The impact of random initialization on the runtime of randomized search heuristics (Q306492) (← links)
- Item:Q287983 (redirect page) (← links)
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- Item:Q287983 (redirect page) (← links)
- From black-box complexity to designing new genetic algorithms (Q487994) (← links)
- Solving problems with unknown solution length at almost no extra cost (Q1725649) (← links)
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- The \((1+1)\) elitist black-box complexity of LeadingOnes (Q1750359) (← links)
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm (Q1750362) (← links)
- Static and self-adjusting mutation strengths for multi-valued decision variables (Q1750364) (← links)
- Optimal parameter choices via precise black-box analysis (Q2007714) (← links)
- Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions (Q2121499) (← links)
- Fixed-target runtime analysis (Q2144280) (← links)
- Self-adjusting mutation rates with provably optimal success rules (Q2240130) (← links)
- \textsc{OneMax} in black-box models with several restrictions (Q2362361) (← links)
- Rumor spreading in random evolving graphs (Q2795745) (← links)
- The Query Complexity of Finding a Hidden Permutation (Q2848962) (← links)
- Rumor Spreading in Random Evolving Graphs (Q2849323) (← links)
- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time (Q2864304) (← links)
- Playing Mastermind With Many Colors (Q3177818) (← links)
- Probabilistic Lower Bounds for the Discrepancy of Latin Hypercube Samples (Q4611807) (← links)
- Mutation Rate Control in the $$(1+\lambda )$$ Evolutionary Algorithm with a Self-adjusting Lower Bound (Q4965121) (← links)
- Calculation of Discrepancy Measures and Applications (Q5264200) (← links)
- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time (Q5494860) (← links)
- Bridging Theory and Practice in Evolutionary Computation? (Q6202145) (← links)