2084 search results - page 391 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
82
Voted
WINE
2005
Springer
15 years 3 months ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
SP
2008
IEEE
15 years 4 months ago
2008
IEEE
Decentralized distributed systems such as peer-to-peer systems are particularly vulnerable to sybil attacks, where a malicious user pretends to have multiple identities (called sy...
ICDT
2010
ACM
15 years 2 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
ISCA
2011
IEEE
14 years 1 months ago
2011
IEEE
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...
72
Voted
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...