2110 search results - page 272 / 422 » What is the complexity of a distributed computing system |
135
click to vote
FMCO
2005
Springer
15 years 10 months ago
2005
Springer
babilistic Chemical Abstract Machine and the Expressiveness of Linda Languages Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, Universi...
115
click to vote
NSPW
2004
ACM
15 years 10 months ago
2004
ACM
We argue in favor of the explicit inclusion of suspicion as a concrete concept to be used in the analysis of audit data in order to guide the search for evidence of misuse. Our ap...
119
click to vote
ISORC
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper presents an analysis of the future of Embedded Linux in the PostPC industry. This analysis is carried out by first examining the current forces at work in the PostPC ma...
130
click to vote
ATAL
2003
Springer
15 years 10 months ago
2003
Springer
We analyse scenarios in which self-interested agents negotiate with each other in order to agree on deals to exchange resources. We consider two variants of the framework, one whe...
159
click to vote
FORMATS
2003
Springer
15 years 10 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...