| 2008 |
|---|
| 15 | EE | Jens Jägersküpper:
Oblivious Randomized Direct Search for Real-Parameter Optimization.
ESA 2008: 553-564 |
| 14 | EE | Jens Jägersküpper,
Mike Preuss:
Aiming for a theoretically tractable CSA variant by means of empirical investigations.
GECCO 2008: 503-510 |
| 13 | EE | Jens Jägersküpper:
A Blend of Markov-Chain and Drift Analysis.
PPSN 2008: 41-51 |
| 12 | EE | Jens Jägersküpper,
Mike Preuss:
Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory.
WEA 2008: 263-274 |
| 11 | EE | Jens Jägersküpper:
Lower bounds for randomized direct search with isotropic sampling.
Oper. Res. Lett. 36(3): 327-332 (2008) |
| 2007 |
|---|
| 10 | EE | Jens Jägersküpper,
Tobias Storch:
When the Plus Strategy Outperforms the Comma Strategyand When Not.
FOCI 2007: 25-32 |
| 9 | EE | Jens Jägersküpper:
Lower Bounds for Hit-and-Run Direct Search.
SAGA 2007: 118-129 |
| 8 | EE | Jens Jägersküpper:
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization.
Theor. Comput. Sci. 379(3): 329-347 (2007) |
| 2006 |
|---|
| 7 | EE | Jens Jägersküpper:
Probabilistic runtime analysis of (1 +<over>, lambda), ES using isotropic mutations.
GECCO 2006: 461-468 |
| 6 | EE | Jens Jägersküpper,
Tobias Storch:
How Comma Selection Helps with the Escape from Local Optima.
PPSN 2006: 52-61 |
| 5 | EE | Jens Jägersküpper:
How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms.
Theor. Comput. Sci. 361(1): 38-56 (2006) |
| 2005 |
|---|
| 4 | EE | Jens Jägersküpper:
On the complexity of overcoming gaps with isotropic mutations and elitist selection.
Congress on Evolutionary Computation 2005: 206-213 |
| 3 | EE | Jens Jägersküpper:
Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes.
FOGA 2005: 260-281 |
| 2 | EE | Jens Jägersküpper,
Carsten Witt:
Rigorous runtime analysis of a (µ+1)ES for the sphere function.
GECCO 2005: 849-856 |
| 2003 |
|---|
| 1 | EE | Jens Jägersküpper:
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces.
ICALP 2003: 1068-1079 |
