The following pages link to Carsten Witt (Q306494):
Displaying 50 items.
- MMAS versus population-based EA on a family of dynamic fitness functions (Q306495) (← links)
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs (Q418035) (← links)
- Runtime analysis of ant colony optimization on dynamic shortest path problems (Q477086) (← links)
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity (Q606874) (← links)
- Runtime analysis of the 1-ANT ant colony optimizer (Q633703) (← links)
- Simplified drift analysis for proving lower bounds in evolutionary computation (Q633834) (← links)
- Improved time complexity analysis of the simple genetic algorithm (Q888423) (← links)
- Ant colony optimization and the minimum spanning tree problem (Q974104) (← links)
- Runtime analysis of a binary particle swarm optimizer (Q974120) (← links)
- Runtime analysis of a simple ant colony optimization algorithm (Q1022344) (← links)
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate (Q1725645) (← links)
- Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (Q1725646) (← links)
- On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization (Q1739102) (← links)
- The impact of a sparse migration topology on the runtime of island models in dynamic optimization (Q1750361) (← links)
- Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis (Q1750363) (← links)
- On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions (Q1775016) (← links)
- Black-box search by unbiased variation (Q1945171) (← links)
- Tight bounds on the expected runtime of a standard steady state genetic algorithm (Q2144273) (← links)
- Self-adjusting evolutionary algorithms for multimodal optimization (Q2144276) (← links)
- Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax (Q2182723) (← links)
- Stagnation detection with randomized local search (Q2233520) (← links)
- Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs (Q2240132) (← links)
- Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint (Q2240133) (← links)
- On the runtime analysis of the simple genetic algorithm (Q2250994) (← links)
- Fitness levels with tail bounds for the analysis of randomized search heuristics (Q2350596) (← links)
- The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax (Q2362360) (← links)
- A runtime analysis of parallel evolutionary algorithms in dynamic optimization (Q2362362) (← links)
- Population size versus runtime of a simple evolutionary algorithm (Q2518379) (← links)
- Runtime analysis for self-adaptive mutation rates (Q2661995) (← links)
- The complex parameter landscape of the compact genetic algorithm (Q2661997) (← links)
- How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys (Q2699946) (← links)
- (Q2904781) (← links)
- Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift (Q2942670) (← links)
- (1+1) EA on Generalized Dynamic OneMax (Q2981881) (← links)
- Edge-Matching Problems with Rotations (Q3088275) (← links)
- (Q3224107) (← links)
- Greedy Local Search and Vertex Cover in Sparse Random Graphs (Q3630226) (← links)
- (Q4436870) (← links)
- On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics (Q4660566) (← links)
- (Q4785464) (← links)
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions (Q4911174) (← links)
- On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms (Q5075410) (← links)
- Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools (Q5215475) (← links)
- Why standard particle swarm optimisers elude a theoretical runtime analysis (Q5276058) (← links)
- When do evolutionary algorithms optimize separable functions in parallel? (Q5276110) (← links)
- Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions (Q5429290) (← links)
- Runtime Analysis of a Simple Ant Colony Optimization Algorithm (Q5459156) (← links)
- STACS 2005 (Q5710700) (← links)
- Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax (Q5738858) (← links)
- Tail bounds on hitting times of randomized search heuristics using variable drift analysis (Q5886098) (← links)
