2214 search results - page 127 / 443 » Dynamic Protocol Recovery |
116
Voted
ISCA
2002
IEEE
15 years 11 days ago
2002
IEEE
Traditional vector architectures have shown to be very effective for regular codes where the compiler can detect data-level parallelism. However, this SIMD parallelism is also pre...
106
Voted
ESA
2001
Springer
15 years 5 months ago
2001
Springer
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
112
Voted
SIGCOMM
2000
ACM
15 years 5 months ago
2000
ACM
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
CONCUR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
102
Voted
MOBICOM
2006
ACM
15 years 6 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...