1977 search results - page 82 / 396 » The satisfactory partition problem |
195
click to vote
PRIS
2004
15 years 7 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...
172
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
163
click to vote
JCT
1998
15 years 5 months ago
1998
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
165
click to vote
PVLDB
2008
15 years 5 months ago
2008
Due to the imperative need to reduce the management costs of large data centers, operators multiplex several concurrent database applications on a server farm connected to shared ...
226
click to vote
ANTSW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this work, we propose a method for self-organized adaptive task partitioning in a swarm of robots. Task partitioning refers to the decomposition of a task into less co...