Pages that link to "Item:Q1725646"

The following pages link to Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (Q1725646):

Displaying 8 items.

• On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization (Q1739102) (← links)
• Working principles of binary differential evolution (Q2007720) (← links)
• The univariate marginal distribution algorithm copes well with deception and epistasis (Q2057117) (← links)
• Does comma selection help to cope with local optima? (Q2144274) (← links)
• A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes (Q2220823) (← links)
• The runtime of the compact genetic algorithm on jump functions (Q2240129) (← 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)