1628 search results - page 170 / 326 » Partitioning Sets with Genetic Algorithms |
121
Voted
SAC
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
145
Voted
JCM
2007
15 years 3 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
151
Voted
JCSS
2002
15 years 3 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
181
Voted
IAJIT
2008
15 years 3 months ago
2008
: The recent explosion in digital video storage and delivery has presented strong motivation for high performance video compression solutions. An efficient video compression techni...
111
Voted
JAL
2002
15 years 3 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...