Thomas Jansen
TitleCited byYear
On the analysis of the (1+ 1) evolutionary algorithm
S Droste, T Jansen, I Wegener
Theoretical Computer Science 276 (1-2), 51-81, 2002
7632002
Upper and lower bounds for randomized search heuristics in black-box optimization
S Droste, T Jansen, I Wegener
Theory of computing systems 39 (4), 525-544, 2006
2132006
On the choice of the offspring population size in evolutionary algorithms
T Jansen, KAD Jong, I Wegener
Evolutionary Computation 13 (4), 413-440, 2005
1882005
Analyzing evolutionary algorithms: The computer science perspective
T Jansen
Springer Science & Business Media, 2013
1712013
The analysis of evolutionary algorithms--a proof that crossover really can help
T Jansen, I Wegener
Algorithmica 34 (1), 47-66, 2002
1582002
A rigorous complexity analysis of the (1+ 1) evolutionary algorithm for separable functions with Boolean inputs
S Droste, T Jansen, I Wegener
Evolutionary Computation 6 (2), 185-196, 1998
1581998
A rigorous complexity analysis of the (1+ 1) evolutionary algorithm for separable functions with Boolean inputs
S Droste, T Jansen, I Wegener
Evolutionary Computation 6 (2), 185-196, 1998
1581998
Optimization with randomized search heuristics--the (A) NFL theorem, realistic scenarios, and difficult functions
S Droste, T Jansen, I Wegener
Theoretical Computer Science 287 (1), 131-144, 2002
1552002
Evolutionary algorithms-how to cope with plateaus of constant fitness and when to reject strings of the same fitness
T Jansen, I Wegener
IEEE Transactions on Evolutionary Computation 5 (6), 589-599, 2001
1482001
Perhaps not a free lunch but at least a free appetizer
S Droste, T Jansen, I Wegener
Proceedings of the 1st Annual Conference on Genetic and Evolutionary …, 1999
1291999
Real royal road functions—where crossover provably is essential
T Jansen, I Wegener
Discrete applied mathematics 149 (1), 111-125, 2005
1252005
On the analysis of evolutionary algorithms—a proof that crossover really can help
T Jansen, I Wegener
European Symposium on Algorithms, 184-193, 1999
801999
On the optimization of unimodal functions with the (1+ 1) evolutionary algorithm
S Droste, T Jansen, I Wegener
International Conference on Parallel Problem Solving from Nature, 13-22, 1998
751998
Real royal road functions—where crossover provably is essential
T Jansen, I Wegener
Proceedings of the 3rd Annual Conference on Genetic and Evolutionary …, 2001
712001
On the choice of the mutation probability for the (1+ 1) EA
T Jansen, I Wegener
International Conference on Parallel Problem Solving from Nature, 89-98, 2000
712000
A building-block royal road where crossover is provably essential
RA Watson, T Jansen
Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007
702007
A New Framework for the Valuation of Algorithms for Black-Box-Optimization
S Droste, T Jansen, I Wegener
FOGA 3, 253-270, 2002
702002
The cooperative coevolutionary (1+ 1) EA
T Jansen, RP Wiegand
Evolutionary Computation 12 (4), 405-434, 2004
682004
Exploring the explorative advantage of the cooperative coevolutionary (1+ 1) EA
T Jansen, RP Wiegand
Genetic and Evolutionary Computation—GECCO 2003, 310-321, 2003
592003
On classifications of fitness functions
T Jansen
Theoretical aspects of evolutionary computing, 371-385, 2001
592001
The system can't perform the operation now. Try again later.
Articles 1–20