Sciweavers

13917 search results - page 98 / 2784
» Abstraction of Probabilistic Systems
Sort
View
SIGIR
1998
ACM
15 years 2 months ago
Modeling and Combining Evidence Provided by Document Relationships Using Probabilistic Argumentation Systems
Previous research has shown that hypertext links may be a useful source of evidence for document contents and relevance, but these evidence are rather difficult to represent and co...
Justin Picard
KIVS
2009
Springer
15 years 4 months ago
Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
M. Adnan Tariq, Boris Koldehofe, Gerald G. Koch, K...
DSN
2005
IEEE
15 years 3 months ago
Probabilistic QoS Guarantees for Supercomputing Systems
Supercomputing systems must be able to reliably and efficiently complete their assigned workloads, even in the presence of failures. This paper proposes a system that allows the ...
Adam J. Oliner, Larry Rudolph, Ramendra K. Sahoo, ...
DSN
2008
IEEE
15 years 4 months ago
Probabilistic quorum systems in wireless ad hoc networks
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
Roy Friedman, Gabriel Kliot, Chen Avin
ENTCS
2006
134views more  ENTCS 2006»
14 years 10 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi