1923 search results - page 185 / 385 » Modeling Complexity in Secure Distributed Computing |
120
click to vote
HPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
The emergence of heterogeneous many core architectures presents a unique opportunity for delivering order of magnitude performance increases to high performance applications by ma...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
EUROSYS
2008
ACM
15 years 7 months ago
2008
ACM
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. While sensor networks have recently emerged as a promising computing model, they are vulnerable to various node compromising attacks. In this paper, we propose COOL, a CO...