Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jens Jägersküpper
2010 – today
- 2011
[j4]Jens Jägersküpper: Combining Markov-Chain Analysis and Drift Analysis - The (1+1) Evolutionary Algorithm on Linear Functions Reloaded. Algorithmica 59(3): 409-424 (2011)- [c13]Jens Jägersküpper, Christian Simmendinger: A Novel Shared-Memory Thread-Pool Implementation for Hybrid Parallel CFD Solvers. Euro-Par (2) 2011: 182-193
2000 – 2009
- 2008
- [j3]Jens Jägersküpper: Lower bounds for randomized direct search with isotropic sampling. Oper. Res. Lett. 36(3): 327-332 (2008)
- [c12]Jens Jägersküpper: Oblivious Randomized Direct Search for Real-Parameter Optimization. ESA 2008: 553-564
- [c11]Jens Jägersküpper, Mike Preuss: Aiming for a theoretically tractable CSA variant by means of empirical investigations. GECCO 2008: 503-510
- [c10]
- [c9]Jens Jägersküpper, Mike Preuss: Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory. WEA 2008: 263-274
- 2007
- [j2]Jens Jägersküpper: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theor. Comput. Sci. 379(3): 329-347 (2007)
- [c8]Jens Jägersküpper, Tobias Storch: When the Plus Strategy Outperforms the Comma Strategyand When Not. FOCI 2007: 25-32
- [c7]
- 2006
- [j1]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)
- [c6]Jens Jägersküpper: Probabilistic runtime analysis of (1 +<over>, lambda), ES using isotropic mutations. GECCO 2006: 461-468
- [c5]Jens Jägersküpper, Tobias Storch: How Comma Selection Helps with the Escape from Local Optima. PPSN 2006: 52-61
- 2005
- [c4]Jens Jägersküpper: On the complexity of overcoming gaps with isotropic mutations and elitist selection. Congress on Evolutionary Computation 2005: 206-213
- [c3]Jens Jägersküpper: Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes. FOGA 2005: 260-281
- [c2]Jens Jägersküpper, Carsten Witt: Rigorous runtime analysis of a (µ+1)ES for the sphere function. GECCO 2005: 849-856
- 2003
- [c1]Jens Jägersküpper: Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces. ICALP 2003: 1068-1079
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:22 CET by the dblp team