Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Thomas Voß

dblp:08/6559 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 4 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 61% Algorithms and data structures · 39%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › multi-objective optimization
many-objective optimization
0.212013
Speeding up many-objective optimization by Monte Carlo approximations · Artif. Intell. 2013
Algorithms and data structures › randomized algorithms
monte carlo methods
0.212013
Speeding up many-objective optimization by Monte Carlo approximations · Artif. Intell. 2013
Mathematical optimization
multi-objective optimization
0.212013
Speeding up many-objective optimization by Monte Carlo approximations · Artif. Intell. 2013
Algorithms and data structures
randomized algorithms
0.012013
Speeding up many-objective optimization by Monte Carlo approximations · Artif. Intell. 2013

Methods — techniques the papers use, named apart from their topics

monte carlo approximation · 0.2
YearPublicationVenuePosition
2013 Speeding up many-objective optimization by Monte Carlo approximations
Karl Bringmann, Tobias Friedrich 0001, Christian Igel, Thomas Voß
Artif. Intell.4
2010 Improved step size adaptation for the MO-CMA-ES
abstract
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Thomas Voß, Nikolaus Hansen, Christian Igel
GECCO1
2010 New Uncertainty Handling Strategies in Multi-objective Evolutionary Optimization
Thomas Voß, Heike Trautmann, Christian Igel
PPSN (2)1
2009 Recombination for Learning Strategy Parameters in the MO-CMA-ES
Thomas Voß, Nikolaus Hansen, Christian Igel
EMO1
2008 Scalarization versus indicator-based selection in multi-objective CMA evolution strategies
abstract
While scalarization approaches to multi- criteria optimization become infeasible in the case of many objectives, for few objectives the benefits of population- based methods compared to a set of independent single- objective optimization trials on scalarized functions are not obvious. The multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES) is a powerful algorithm for real-valued multi-criteria optimization. This population- based approach combines mutation and strategy adaptation from the elitist CMA-ES with multi-objective selection. We empirically compare the steady-state MO-CMA-ES with different scalarization algorithms, in which the elitist CMA-ES is used as single-objective optimizer. Although only bicriteria benchmark problems are considered, the MO-CMA-ES performs best in the overall comparison. However, if the scalarized problems have a structure that can easily be exploited by the CMA-ES and that is less apparent in the vector-valued fitness function, the CMA- ES with scalarization outperforms the population-based approach.
Thomas Voß, Nicola Beume, Günter Rudolph, Christian Igel
IEEE Congress on Evolutionary Computation1