1717 search results - page 38 / 344 » On the analysis of the (1 1) memetic algorithm |
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
MP
2011
13 years 3 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
ICFCA
2009
Springer
14 years 3 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...