Spremljaj
Carsten Witt
Naslov
Navedeno
Navedeno
Leto
Bioinspired Computation in Combinatorial Optimization - Combinatorial optimization and computational complexity
F Neumann, C Witt
Springer, Berlin, Heidelberg, 2010
503*2010
Runtime analysis of the (μ+ 1) EA on simple pseudo-Boolean functions
C Witt
Evolutionary Computation 14 (1), 65-86, 2006
237*2006
Black-box search by unbiased variation
PK Lehre, C Witt
Proceedings of the 12th annual conference on Genetic and evolutionary …, 2010
2212010
Worst-case and average-case approximations by simple randomized search heuristics
C Witt
Annual Symposium on Theoretical Aspects of Computer Science, 44-56, 2005
1892005
Tight bounds on the optimization time of a randomized search heuristic on linear functions
C Witt
Combinatorics, Probability and Computing 22 (02), 294-318, 2013
1812013
Simplified drift analysis for proving lower bounds in evolutionary computation
PS Oliveto, C Witt
Algorithmica 59 (3), 369-386, 2011
1802011
Approximating covering problems by randomized search heuristics using multi-objective models
T Friedrich, N Hebbinghaus, F Neumann, J He, C Witt
Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007
1772007
Improved time complexity analysis of the simple genetic algorithm
PS Oliveto, C Witt
Theoretical Computer Science 605, 21-41, 2015
1262015
Analysis of diversity-preserving mechanisms for global exploration*
T Friedrich, PS Oliveto, D Sudholt, C Witt
Evolutionary Computation 17 (4), 455-476, 2009
1202009
Ant colony optimization and the minimum spanning tree problem
F Neumann, C Witt
Theoretical Computer Science 411 (25), 2406-2413, 2010
1122010
Runtime analysis of a simple ant colony optimization algorithm
F Neumann, C Witt
Algorithms and Computation: 17th International Symposium, ISAAC 2006 …, 2006
1002006
On the optimization of monotone polynomials by simple randomized search heuristics
I Wegener, C Witt
Combinatorics, Probability and Computing 14 (1-2), 225-247, 2005
98*2005
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus
F Neumann, D Sudholt, C Witt
Swarm Intelligence 3 (1), 35-68, 2009
97*2009
Concentrated hitting times of randomized search heuristics with variable drift
PK Lehre, C Witt
International Symposium on Algorithms and Computation, 686-697, 2014
91*2014
Population size versus runtime of a simple evolutionary algorithm
C Witt
Theoretical Computer Science 403 (1), 104-120, 2008
89*2008
On the runtime analysis of the simple genetic algorithm
PS Oliveto, C Witt
Theoretical Computer Science 545, 2-19, 2014
85*2014
Runtime analysis of a simple ant colony optimization algorithm
F Neumann, C Witt
Algorithmica 54 (2), 243-255, 2009
842009
A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability
J He, C Reeves, C Witt, X Yao
Evolutionary Computation 15 (4), 435-443, 2007
802007
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions
I Wegener, C Witt
Journal of Discrete Algorithms 3 (1), 61-78, 2005
78*2005
Theoretical analysis of fitness-proportional selection: landscapes and efficiency
F Neumann, PS Oliveto, C Witt
Proceedings of the 11th Annual conference on Genetic and evolutionary …, 2009
772009
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20