2900 search results - page 56 / 580 » On the Convergence of Immune Algorithms |
AUSDM
2006
Springer
15 years 3 months ago
2006
Springer
When different subsamples of the same data set are used to induce classification trees, the structure of the built classifiers is very different. The stability of the structure of ...
ALT
2004
Springer
15 years 8 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
108
click to vote
SIAMJO
2010
14 years 6 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
106
click to vote
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...