155 search results - page 9 / 31 » A Comparison Between ACO Algorithms for the Set Covering Pro... |
128
click to vote
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
117
Voted
ECIR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Social bookmarking systems allow users to store links to internet resources on a web page. As social bookmarking systems are growing in popularity, search algorithms have...
103
click to vote
FCT
2003
Springer
15 years 8 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
136
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
158
click to vote
PRIS
2004
15 years 4 months ago
2004
We address the problem of the combination of multiple data partitions, that we call a clustering ensemble. We use a recent clustering approach, known as Spectral Clustering, and th...