170 search results - page 11 / 34 » On the Probability of the Number of Solutions for the P4P Pr... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
GECCO
2003
Springer
14 years 19 days ago
2003
Springer
This paper proposes a new mating scheme for evolutionary multiobjective optimization (EMO), which simultaneously improves the convergence speed to the Pareto-front and the diversit...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
FOCI
2007
IEEE
14 years 1 months ago
2007
IEEE
Immune Algorithms have been used widely and successfully in many computational intelligence areas including optimization. Given the large number of variants of each operator of thi...
WSC
2007
13 years 9 months ago
2007
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...