Jens Jägersküpper

According to our database, Jens Jägersküpper authored at least 21 papers between 2003 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

HPC Requirements of High-Fidelity Flow Simulations for Aerodynamic Applications.

Axel Probst, Tobias Knopp, Cornelia Grabe, Jens Jägersküpper

Proceedings of the Euro-Par 2019: Parallel Processing Workshops, 2019

2012

GASPI - A Partitioned Global Address Space Programming Interface.

Thomas Alrutz, Jan Backhaus, Thomas Brandes, Vanessa End, Thomas Gerhold, Alfred Geiger, Daniel Grünewald, Vincent Heuveline, Jens Jägersküpper, Andreas Knüpfer, Olaf Krzikalla, Edmund Kügeler, Carsten Lojewski, Guy Lonsdale, Ralph Müller-Pfefferkorn, Wolfgang E. Nagel, Lena Oden, Franz-Josef Pfreundt, Mirko Rahn, Michael Sattler, Mareike Schmidtobreick, Annika Schiller, Christian Simmendinger, Thomas Soddemann, Godehard Sutmann, Henning Weber, Jan-Philipp Weiss

Proceedings of the Facing the Multicore-Challenge, 2012

2011

Combining Markov-Chain Analysis and Drift Analysis - The (1+1) Evolutionary Algorithm on Linear Functions Reloaded.

Jens Jägersküpper

Algorithmica, 2011

A Novel Shared-Memory Thread-Pool Implementation for Hybrid Parallel CFD Solvers.

Jens Jägersküpper, Christian Simmendinger

Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010

HICFD: Highly Efficient Implementation of CFD Codes for HPC Many-Core Architectures.

Achim Basermann, Hans-Peter Kersken, Andreas Schreiber, Thomas Gerhold, Jens Jägersküpper, Norbert Kroll, Jan Backhaus, Edmund Kügeler, Thomas Alrutz, Christian Simmendinger, Kim Feldhoff, Olaf Krzikalla, Ralph Müller-Pfefferkorn, Mathias Puetz, Petra Aumann, Olaf Knobloch, Jörg Hunger, Carsten Zscherp

Proceedings of the Competence in High Performance Computing 2010, 2010

2008

Lower bounds for randomized direct search with isotropic sampling.

Jens Jägersküpper

Oper. Res. Lett., 2008

Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory.

Jens Jägersküpper, Mike Preuss

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

A Blend of Markov-Chain and Drift Analysis.

Jens Jägersküpper

Proceedings of the Parallel Problem Solving from Nature, 2008

Aiming for a theoretically tractable CSA variant by means of empirical investigations.

Jens Jägersküpper, Mike Preuss

Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Oblivious Randomized Direct Search for Real-Parameter Optimization.

Jens Jägersküpper

Proceedings of the Algorithms, 2008

2007

Probabilistic analysis of evolution strategies using isotropic mutations

Jens Jägersküpper

PhD thesis, 2007

Algorithmic analysis of a basic evolutionary algorithm for continuous optimization.

Jens Jägersküpper

Theor. Comput. Sci., 2007

Lower Bounds for Hit-and-Run Direct Search.

Jens Jägersküpper

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

When the Plus Strategy Outperforms the Comma Strategyand When Not.

Jens Jägersküpper, Tobias Storch

Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2007

2006

How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms.

Jens Jägersküpper

Theor. Comput. Sci., 2006

How Comma Selection Helps with the Escape from Local Optima.

Jens Jägersküpper, Tobias Storch

Proceedings of the Parallel Problem Solving from Nature, 2006

Probabilistic runtime analysis of (1 +<over>, lambda), ES using isotropic mutations.

Jens Jägersküpper

Proceedings of the Genetic and Evolutionary Computation Conference, 2006

2005

Rigorous runtime analysis of a (µ+1)ES for the sphere function.

Jens Jägersküpper, Carsten Witt

Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes.

Jens Jägersküpper

Proceedings of the Foundations of Genetic Algorithms, 8th International Workshop, 2005

On the complexity of overcoming gaps with isotropic mutations and elitist selection.

Jens Jägersküpper

Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2003

Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces.

Jens Jägersküpper

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003