1434 search results - page 243 / 287 » Distributed Computing with Imperfect Randomness |
LATIN
2004
Springer
14 years 29 days ago
2004
Springer
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...
EUROPAR
2003
Springer
14 years 25 days ago
2003
Springer
Recently, a server-less video-on-demand architecture has been proposed which can completely eliminate costly dedicated video servers and yet is highly scalable and reliable. Due to...
HIPC
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
ICALP
2003
Springer
14 years 24 days ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
ICNP
2002
IEEE
14 years 16 days ago
2002
IEEE
This paper presents the first analytical model to derive the saturation throughput of collision avoidance protocols in multi-hop ad hoc networks with nodes randomly placed accord...