1300 search results - page 216 / 260 » Probabilistic logic with independence |
TSE
2011
13 years 2 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Let f be a function on Rd that is monotonic in every variable. There are 2d possible assignments to the directions of monotonicity (two per variable). We provide sufficient condit...