1578 search results - page 21 / 316 » Algorithmic randomness of continuous functions |
GECCO
2009
Springer
14 years 11 months ago
2009
Springer
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
JCST
2008
14 years 6 months ago
2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
ESA
1998
Springer
14 years 11 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
ECCC
2011
13 years 10 months ago
2011
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
EOR
2008
14 years 7 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...