1192 search results - page 130 / 239 » Computing Weakest Readings |
140
Voted
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
126
Voted
ICDCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...
124
Voted
NETGAMES
2006
ACM
15 years 9 months ago
2006
ACM
Multi-player Online Games (MOGs) have emerged as popular data intensive applications in recent years. Being used by many players simultaneously, they require a high degree of faul...
123
Voted
ICDCS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
137
Voted
EUROPAR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. With the prevalence of multi-core processors and cloud computing, the server consolidation using virtualization has increasingly expanded its territory, and the degree of...