264 search results - page 32 / 53 » Bounding the number of tolerable faults in majority-based sy... |
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
PERCOM
2006
ACM
15 years 9 months ago
2006
ACM
The proliferation of cell phones has led to an ever increasing number of inappropriate interruptions. SmartContacts provides a solution to this problem by empowering the caller to...
FTCS
1993
14 years 10 months ago
1993
Fault tolerance requirements for near term disk array storage systems are analyzed. The excellent reliability provided by RAID Level 5 data organization is seen to be insu cient f...
SPDP
1993
IEEE
15 years 1 months ago
1993
IEEE
This paper presents a solution to the (processor) group membership problem. The methodology followed in designing the algorithm is summarized by the option to optimize the perform...
57
Voted
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...