2899 search results - page 7 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
102
click to vote
CLUSTER
2001
IEEE
15 years 4 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
126
click to vote
ICONIP
2008
15 years 2 months ago
2008
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
112
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
114
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
135
click to vote
HICSS
2003
IEEE
15 years 6 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...