4110 search results - page 223 / 822 » Efficient algorithms for the 2-gathering problem |
155
click to vote
ICDAR
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
160
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
226
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
155
click to vote
TCS
2008
15 years 6 months ago
2008
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...