1923 search results - page 233 / 385 » Modeling Complexity in Secure Distributed Computing |
107
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...
ACSAC
2007
IEEE
15 years 4 months ago
2007
IEEE
Integrity measurements provide a means by which distributed systems can assess the trustability of potentially compromised remote hosts. However, current measurement techniques si...
IPL
2011
14 years 1 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
WSC
1997
14 years 11 months ago
1997
Components of modern parallel systems are becoming quite complex with many features and variations. An integrated modeling of these components (interconnection network, messaging ...