|
101 |
Neyman-Pearson theory of testing and Mayo s extensions applied to evolutionary computing
Bartz-Beielstein, Thomas. - Dortmund : Universitätsbibliothek Dortmund, 2006
|
|
|
|
102 |
On the Complexity of Overcoming Gaps When Using Elitist Selection and Isotropic Mutations
Jägersküpper, Jens. - Dortmund : Universitätsbibliothek Dortmund, 2006
|
|
|
|
103 |
Pareto set and EMOA behavior for simple multimodal multiobjective functions
Naujoks, Boris. - Dortmund : Universitätsbibliothek Dortmund, 2006
|
|
|
|
104 |
Polyhedra and algorithms for the general routing problem
Theis, Dirk, [2006]
|
|
|
|
105 |
Probleme der Tourenbildung
Kämpf, Michael. - Chemnitz : Universitätsbibliothek Chemnitz, 2006
|
|
|
|
106 |
Scenario reduction in stochastic programming with respect to discrepancy distances
Henrion, René. - Berlin : Humboldt-Universität zu Berlin, 2006
|
|
|
|
107 |
Scheduling unrelated parallel machines
Wotzlaw, Andreas, 2006
|
|
|
|
108 |
Takeover time in parallel populations with migration
Rudolph, Günter. - Dortmund : Universitätsbibliothek Dortmund, 2006
|
|
|
|
109 |
When the plus strategy performs better than the comma strategy - and when not
Jägersküpper, Jens. - Dortmund : Universitätsbibliothek Dortmund, 2006
|
|
|
|
110 |
Why comma selection can help with the escape from local optima
Jägersküpper, Jens. - Dortmund : Universitätsbibliothek Dortmund, 2006
|
|
Administration
