Pages that link to "Item:Q633834"

The following pages link to Simplified drift analysis for proving lower bounds in evolutionary computation (Q633834):

Displaying 39 items.

• Robustness of populations in stochastic environments (Q306488) (← links)
• Concentration of first hitting times under additive drift (Q306489) (← links)
• Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems (Q306491) (← links)
• Non-existence of linear universal drift functions (Q428906) (← links)
• Runtime analysis of ant colony optimization on dynamic shortest path problems (Q477086) (← links)
• The time complexity analysis of a class of gene expression programming (Q521683) (← links)
• Free lunches on the discrete Lipschitz class (Q633702) (← links)
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
• Simplified drift analysis for proving lower bounds in evolutionary computation (Q633834) (← links)
• Improved time complexity analysis of the simple genetic algorithm (Q888423) (← links)
• Analysis of runtime of optimization algorithms for noisy functions over discrete codomains (Q888426) (← links)
• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise (Q1725652) (← links)
• Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions (Q1728256) (← links)
• Adaptive drift analysis (Q1939672) (← links)
• Multiplicative drift analysis (Q1945169) (← links)
• Does comma selection help to cope with local optima? (Q2144274) (← links)
• Runtime analysis of evolutionary algorithms via symmetry arguments (Q2224858) (← links)
• The runtime of the compact genetic algorithm on jump functions (Q2240129) (← links)
• On the runtime analysis of the simple genetic algorithm (Q2250994) (← links)
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm (Q2250995) (← links)
• Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming (Q2306017) (← links)
• First-hitting times under drift (Q2333786) (← links)
• \textsc{OneMax} in black-box models with several restrictions (Q2362361) (← links)
• Populations can be essential in tracking dynamic optima (Q2362363) (← links)
• Towards a runtime comparison of natural and artificial evolution (Q2362364) (← links)
• On the benefits and risks of using fitness sharing for multimodal optimisation (Q2415319) (← links)
• Analysis of noisy evolutionary optimization when sampling fails (Q2661993) (← links)
• Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial (Q2661994) (← links)
• The complex parameter landscape of the compact genetic algorithm (Q2661997) (← links)
• On the impact of the performance metric on efficient algorithm configuration (Q2667810) (← links)
• When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not (Q2680763) (← links)
• Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift (Q2942670) (← links)
• Drift Analysis and Evolutionary Algorithms Revisited (Q3177365) (← links)
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis (Q5886098) (← links)
• Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter (Q6182679) (← links)
• Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function (Q6494347) (← links)
• Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation (Q6566616) (← links)
• Fourier analysis meets runtime analysis: precise runtimes on plateaus (Q6586657) (← links)
• Analysis of the survival time of the SIRS process via expansion (Q6595698) (← links)