Thomas Jansen

From MaRDI portal
Revision as of 12:55, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:592022

Available identifiers

zbMath Open jansen.thomasMaRDI QIDQ592022

List of research outcomes





PublicationDate of PublicationType
Experimental and theoretical analysis of local search optimising OBDD variable orderings2024-11-12Paper
Introduction to the theory of complexity and approximation algorithms2018-07-03Paper
Analysis of evolutionary algorithms2017-07-14Paper
Approximating vertex cover using edge-based representations2017-07-14Paper
Populations can be essential in tracking dynamic optima2017-07-07Paper
On easiest functions for mutation operators in bio-inspired optimisation2017-07-07Paper
On the Black-Box Complexity of Example Functions2017-05-10Paper
Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics2016-01-11Paper
Performance analysis of randomised search heuristics operating with a fixed budget2014-07-10Paper
https://portal.mardi4nfdi.de/entity/Q32241062012-03-29Paper
Analyzing different variants of immune inspired somatic contiguous hypermutations2011-02-21Paper
On benefits and drawbacks of aging strategies for randomized search heuristics2011-02-21Paper
Analyzing evolutionary algorithms. The computer science perspective.2010-12-08Paper
Stability in the self-organized evolution of networks2010-03-04Paper
Analysis of evolutionary algorithms for the longest common subsequence problem2010-03-04Paper
On the analysis of a dynamic evolutionary algorithm2008-01-11Paper
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation2007-10-25Paper
On the Brittleness of Evolutionary Algorithms2007-09-07Paper
Upper and lower bounds for randomized search heuristics in black-box optimization2006-10-25Paper
Foundations of Genetic Algorithms2005-11-11Paper
Real royal road functions -- where crossover provably is essential2005-09-02Paper
https://portal.mardi4nfdi.de/entity/Q44603482004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44478262004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44368162003-12-04Paper
Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.2003-01-21Paper
The analysis of evolutionary algorithms -- A proof that crossover really can help2002-12-01Paper
On the analysis of the \((1+1)\) evolutionary algorithm2002-07-15Paper
Dynamic parameter control in simple evolutionary algorithms2002-02-28Paper
https://portal.mardi4nfdi.de/entity/Q27516082001-10-21Paper
https://portal.mardi4nfdi.de/entity/Q49387762000-02-23Paper

Research outcomes over time

This page was built for person: Thomas Jansen