1434 search results - page 45 / 287 » Distributed Computing with Imperfect Randomness |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
PODC
2003
ACM
14 years 26 days ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
CCR
2006
13 years 7 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
AIPS
2009
13 years 8 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...