2084 search results - page 366 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
104
click to vote
IOR
2010
14 years 8 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
ESORICS
2004
Springer
15 years 3 months ago
2004
Springer
We evaluate the anonymity provided by two popular email mix implementations, Mixmaster and Reliable, and compare their effectiveness through the use of simulations which model th...
101
click to vote
FCCM
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...