Sciweavers

2276 search results - page 72 / 456
» Failure of A Mix Network
Sort
View
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
138
Voted
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 9 months ago
Timing-driven partitioning for two-phase domino and mixed static/domino implementations
Domino logic is a high-performance circuit configuration that is usually embedded in static logic environment and tightly coupled with the clocking scheme. In this paper, the timi...
Min Zhao, Sachin S. Sapatnekar
137
Voted
PPL
2000
110views more  PPL 2000»
15 years 4 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
PODC
2009
ACM
15 years 11 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
147
Voted
EUROPAR
2007
Springer
15 years 10 months ago
Modeling and Validating the Performance of Atomic Broadcast Algorithms in High Latency Networks
Abstract. The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the ...
Richard Ekwall, André Schiper