Sciweavers

323 search results - page 49 / 65
» The Fault Tolerance of NP-Hard Problems
Sort
View
PODC
2009
ACM
16 years 24 days 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...
DAC
2009
ACM
16 years 7 months ago
Decoding nanowire arrays fabricated with the multi-spacer patterning technique
Silicon nanowires are a promising solution to address the increasing challenges of fabrication and design at the future nodes of the Complementary Metal-Oxide-Semiconductor (CMOS)...
M. Haykel Ben Jamaa, Yusuf Leblebici, Giovanni De ...
DAC
2008
ACM
16 years 7 months ago
Study of the effects of MBUs on the reliability of a 150 nm SRAM device
1 Soft errors induced by radiation are an increasing problem in the microelectronic field. Although traditional models estimate the reliability of memories suffering Single Event U...
Juan Antonio Maestro, Pedro Reviriego
PADL
2009
Springer
16 years 6 months ago
Operational Semantics for Declarative Networking
Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a ...
Juan A. Navarro, Andrey Rybalchenko
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 6 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan