4816 search results - page 157 / 964 » Performance analysis of the AntNet algorithm |
187
Voted
ICFCA
2009
Springer
16 years 28 days 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...
169
click to vote
ISAAC
2009
Springer
16 years 21 days 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...
148
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
158
click to vote
GECCO
2009
Springer
16 years 21 days ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
150
click to vote
WAOA
2007
Springer
16 years 7 days ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...