Pages that link to "Item:Q5241813"

The following pages link to Theory of Evolutionary Computation (Q5241813):

Displaying 50 items.

• A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions (Q2144272) (← links)
• Tight bounds on the expected runtime of a standard steady state genetic algorithm (Q2144273) (← links)
• Does comma selection help to cope with local optima? (Q2144274) (← links)
• Self-adjusting evolutionary algorithms for multimodal optimization (Q2144276) (← links)
• Fast mutation in crossover-based algorithms (Q2144278) (← links)
• Fixed-target runtime analysis (Q2144280) (← links)
• The average distance and the diameter of dense random regular graphs (Q2200440) (← links)
• On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms (Q2211362) (← links)
• Exponential upper bounds for the runtime of randomized search heuristics (Q2220808) (← links)
• A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes (Q2220823) (← links)
• Runtime analysis of evolutionary algorithms via symmetry arguments (Q2224858) (← links)
• Stagnation detection with randomized local search (Q2233520) (← links)
• On negative dependence properties of Latin hypercube samples and scrambled nets (Q2238851) (← links)
• Multiplicative up-drift (Q2240128) (← links)
• The runtime of the compact genetic algorithm on jump functions (Q2240129) (← links)
• Self-adjusting mutation rates with provably optimal success rules (Q2240130) (← links)
• Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131) (← links)
• Runtime analysis for self-adaptive mutation rates (Q2661995) (← links)
• A tight runtime analysis for the \((\mu + \lambda)\) EA (Q2661996) (← links)
• When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not (Q2680763) (← links)
• Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences (Q2681004) (← links)
• Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs (Q2689443) (← links)
• Do additional target points speed up evolutionary algorithms? (Q2690877) (← links)
• How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys (Q2699946) (← links)
• Mutation Rate Control in the $$(1+\lambda )$$ Evolutionary Algorithm with a Self-adjusting Lower Bound (Q4965121) (← links)
• The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm (Q5060081) (← links)
• (Q5874488) (← links)
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis (Q5886098) (← links)
• Stagnation detection meets fast mutation (Q5918778) (← links)
• Reversible random walks on dynamic graphs (Q6063351) (← links)
• (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error (Q6161501) (← links)
• Bivariate estimation-of-distribution algorithms can find an exponential number of optima (Q6175524) (← links)
• Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax (Q6177181) (← links)
• Lower bounds from fitness levels made easy (Q6182674) (← links)
• Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution (Q6182676) (← links)
• Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter (Q6182679) (← links)
• An extended jump functions benchmark for the analysis of randomized search heuristics (Q6185933) (← links)
• Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem (Q6185935) (← links)
• Runtime analysis for permutation-based evolutionary algorithms (Q6185938) (← links)
• Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function (Q6494347) (← links)
• Estimation-of-distribution algorithms for multi-valued decision variables (Q6549682) (← links)
• Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation (Q6566616) (← links)
• Nearest neighbor sampling of point sets using rays (Q6575299) (← links)
• Parameter identification of multibody vehicle models using neural networks (Q6575337) (← links)
• Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function (Q6582376) (← links)
• Fourier analysis meets runtime analysis: precise runtimes on plateaus (Q6586657) (← links)
• Asynchronous opinion dynamics in social networks (Q6601208) (← links)
• Stagnation detection in highly multimodal fitness landscapes (Q6614111) (← links)
• Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions (Q6623583) (← links)
• Runtime analysis of quality diversity algorithms (Q6623587) (← links)