674 search results - page 118 / 135 » The computational complexity of the parallel knock-out probl... |
84
Voted
ICDCS
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
SC
2009
ACM
15 years 4 months ago
2009
ACM
Scientific workflow tools allow users to specify complex computational experiments and provide a good framework for robust science and engineering. Workflows consist of pipelines ...
92
Voted
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
95
Voted
ICS
2010
Tsinghua U.
15 years 1 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...