Heike Trautmann

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jorn Mehnen

> Home > Persons > Heike Trautmann

Publications

2009
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ec/TrautmannWNPM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ec/TrautmannWNPM09
Heike Trautmann, Tobias Wagner, Boris Naujoks, Mike Preuß, Jörn Mehnen:
Statistical Methods for Convergence Detection of Multi-Objective Evolutionary Algorithms. Evol. Comput. 17(4): 493-509 (2009)
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/cec/TrautmannMN09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/TrautmannMN09
Heike Trautmann, Jörn Mehnen, Boris Naujoks:
Pareto-dominance in noisy environments. IEEE Congress on Evolutionary Computation 2009: 3119-3126
2008
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/ppsn/TrautmannLMP08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ppsn/TrautmannLMP08
Heike Trautmann, Uwe Ligges, Jörn Mehnen, Mike Preuss:
A Convergence Criterion for Multiobjective Evolutionary Algorithms Based on Systematic Statistical Testing. PPSN 2008: 825-836
2007
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/cec/MehnenTT07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/MehnenTT07
Jörn Mehnen, Heike Trautmann, Ashutosh Tiwari:
Introducing user preference using Desirability Functions in Multi-Objective Evolutionary Optimisation of noisy processes. IEEE Congress on Evolutionary Computation 2007: 2687-2694

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.