2013 - ACM Senior Member
Thomas Jansen mostly deals with Evolutionary algorithm, Mathematical optimization, Evolutionary computation, Heuristics and Algorithm. His Evolutionary algorithm study incorporates themes from Genetic algorithm, Polynomial and Crossover. His work carried out in the field of Polynomial brings together such families of science as Unimodality, Randomized search, Mutation rate and Degree.
His Evolutionary computation research is multidisciplinary, incorporating perspectives in Memetic algorithm, Management science and Cultural algorithm. His Heuristics study combines topics from a wide range of disciplines, such as Beam search and Search algorithm. His work in Algorithm addresses issues such as Exponential function, which are connected to fields such as Simple.
His primary areas of investigation include Evolutionary algorithm, Mathematical optimization, Heuristics, Evolutionary computation and Algorithm. His work deals with themes such as Function, Genetic algorithm and Theoretical computer science, which intersect with Evolutionary algorithm. His work on Search algorithm, Optimization problem and Simulated annealing is typically connected to Point as part of general Mathematical optimization study, connecting several disciplines of science.
The concepts of his Heuristics study are interwoven with issues in Local search, Artificial immune system and Heuristic. His Algorithm study integrates concerns from other disciplines, such as Crossover, Exponential function, Polynomial and Mutation. His studies deal with areas such as Memetic algorithm and Cultural algorithm as well as Evolutionary programming.
His main research concerns Mathematical optimization, Heuristics, Evolutionary algorithm, Artificial intelligence and Simple. The various areas that Thomas Jansen examines in his Mathematical optimization study include Range, Selection and FP. His Heuristics research focuses on Perspective and how it relates to Computational intelligence and Evolutionary computation.
His research on Evolutionary algorithm also deals with topics like
His primary areas of study are Mathematical optimization, Evolutionary algorithm, Heuristics, Theory of computation and Artificial intelligence. His Mathematical optimization research incorporates themes from Time complexity, Worst-case complexity, Descriptive complexity theory, Complexity index and Structural complexity theory. Thomas Jansen applies his multidisciplinary studies on Evolutionary algorithm and Upper and lower bounds in his research.
His Heuristics research integrates issues from Evolutionary computation, Perspective and Computational intelligence. His Theory of computation study combines topics in areas such as Tracking, Population based algorithm, Function, Large population and Natural class. His Artificial intelligence research is multidisciplinary, relying on both Simple, Fitness landscape and Machine learning.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
On the analysis of the (1+ 1) evolutionary algorithm
Stefan Droste;Thomas Jansen;Ingo Wegener.
Theoretical Computer Science (2002)
On the analysis of the (1+ 1) evolutionary algorithm
Stefan Droste;Thomas Jansen;Ingo Wegener.
Theoretical Computer Science (2002)
Parallel Problem Solving from Nature – PPSN X
Günter Rudolph;Thomas Jansen;Nicola Beume;Simon Lucas.
(2008)
Parallel Problem Solving from Nature – PPSN X
Günter Rudolph;Thomas Jansen;Nicola Beume;Simon Lucas.
(2008)
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Stefan Droste;Thomas Jansen;Ingo Wegener.
Theory of Computing Systems / Mathematical Systems Theory (2006)
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Stefan Droste;Thomas Jansen;Ingo Wegener.
Theory of Computing Systems / Mathematical Systems Theory (2006)
On the Choice of the Offspring Population Size in Evolutionary Algorithms
Thomas Jansen;Kenneth A. De Jong;Ingo Wegener.
Evolutionary Computation (2005)
On the Choice of the Offspring Population Size in Evolutionary Algorithms
Thomas Jansen;Kenneth A. De Jong;Ingo Wegener.
Evolutionary Computation (2005)
Analyzing Evolutionary Algorithms: The Computer Science Perspective
Thomas Jansen.
(2013)
Analyzing Evolutionary Algorithms: The Computer Science Perspective
Thomas Jansen.
(2013)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Sheffield
École Polytechnique
University of Adelaide
Queen Mary University of London
George Mason University
Technical University of Denmark
University of York
Hasso Plattner Institute
Roche (Switzerland)
University College Cork
Fudan University
Lyons
University of Illinois at Chicago
Nanyang Technological University
Nanyang Technological University
Aarhus University
Austrian Academy of Sciences
Cornell University
Purdue University West Lafayette
University of Toronto
Karolinska Institute
KU Leuven
Imperial College London
Peking University
Duke University
Academia Sinica