12015 search results - page 599 / 2403 » Interactive Algorithms 2005 |
160
click to vote
ICDCS
2005
IEEE
16 years 1 days ago
2005
IEEE
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
192
Voted
INFOCOM
2005
IEEE
16 years 1 days ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
225
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
139
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
183
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to spee...