Pages that link to "Item:Q2389686"

The following pages link to A new approach to estimating the expected first hitting time of evolutionary algorithms (Q2389686):

Displaying 11 items.

• On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← 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)
• Drift analysis of mutation operations for biogeography-based optimization (Q521639) (← links)
• The time complexity analysis of a class of gene expression programming (Q521683) (← links)
• On convergence analysis of particle swarm optimization algorithm (Q679575) (← links)
• On the genetic algorithm with adaptive mutation rate and selected statistical applications (Q736997) (← links)
• Choosing selection pressure for wide-gap problems (Q847671) (← links)
• Reprint of: On convergence analysis of particle swarm optimization algorithm (Q1636822) (← links)
• The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems (Q1928267) (← links)
• Variable solution structure can be helpful in evolutionary optimization (Q5046487) (← links)