Pages that link to "Item:Q1849764"

The following pages link to The analysis of evolutionary algorithms -- A proof that crossover really can help (Q1849764):

Displaying 37 items.

• Running time analysis of ant colony optimization for shortest path problems (Q414437) (← links)
• Crossover can be constructive when computing unique input-output sequences (Q416273) (← links)
• Crossover can provably be useful in evolutionary computation (Q418021) (← links)
• The use of tail inequalities on the probable computational time of randomized search heuristics (Q428911) (← links)
• An analysis on recombination in multi-objective evolutionary optimization (Q490439) (← links)
• Practical performance models of algorithms in evolutionary program induction and other domains (Q622115) (← links)
• Comparison of simple diversity mechanisms on plateau functions (Q1029353) (← links)
• An analysis of an embedded crossover scheme on a GA-hard problem (Q1342328) (← links)
• How to escape local optima in black box optimisation: when non-elitism outperforms elitism (Q1750360) (← links)
• Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm (Q1750362) (← links)
• More effective crossover operators for the all-pairs shortest path problem (Q1935817) (← links)
• 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)
• On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms (Q2211362) (← links)
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation (Q2211864) (← links)
• The runtime of the compact genetic algorithm on jump functions (Q2240129) (← links)
• Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs (Q2240132) (← links)
• Performance analysis of randomised search heuristics operating with a fixed budget (Q2250996) (← links)
• Reducing the arity in unbiased black-box complexity (Q2251000) (← links)
• Real royal road functions -- where crossover provably is essential (Q2387434) (← links)
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation (Q2455595) (← links)
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem (Q2503277) (← links)
• The one-dimensional Ising model: mutation versus recombination (Q2575079) (← links)
• Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem (Q2661998) (← links)
• How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys (Q2699946) (← links)
• Bimodal performance profile of evolutionary search and the effects of crossover (Q2751598) (← links)
• Analysis of recombinative algorithms on a non-separable building-block problem (Q2776407) (← links)
• The mixing rate of different crossover operators (Q2776419) (← links)
• A note on the ring loading problem (Q2790401) (← links)
• Hitting times of local and global optima in genetic algorithms with very high selection pressure (Q4987699) (← 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)
• An extended jump functions benchmark for the analysis of randomized search heuristics (Q6185933) (← links)
• Runtime analysis for permutation-based evolutionary algorithms (Q6185938) (← links)
• Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation (Q6566616) (← links)
• Analysing equilibrium states for population diversity (Q6582367) (← links)