137 search results - page 17 / 28 » Probabilistic algorithm for finding roots of linearized poly... |
152
Voted
EC
2008
15 years 2 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
120
click to vote
AUTOMATICA
2008
15 years 2 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
92
Voted
ANTS
2006
Springer
15 years 6 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
156
Voted
GECCO
2011
Springer
14 years 6 months ago
2011
Springer
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
112
Voted
SOCO
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...