1592 search results - page 76 / 319 » On the Equality of Probabilistic Terms |
DSN
2008
IEEE
15 years 4 months ago
2008
IEEE
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...
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
107
click to vote
KR
2010
Springer
15 years 2 months ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
This paper concerns the problem of agent trust in an electronic market place. We maintain that agent trust involves making decisions under uncertainty and therefore the phenomenon...
134
click to vote
SIGMOD
2012
ACM
13 years 11 days ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...