264 search results - page 9 / 53 » Bounding the number of tolerable faults in majority-based sy... |
FDTC
2006
Springer
15 years 1 months ago
2006
Springer
With physical attacks threatening the security of current cryptographic schemes, no security policy can be developed without taking into account the physical nature of computation....
109
click to vote
RTAS
2007
IEEE
15 years 3 months ago
2007
IEEE
Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibili...
JCO
2008
14 years 9 months ago
2008
The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...