1341 search results - page 63 / 269 » Probabilistic Abstraction Hierarchies |
181
click to vote
CONCUR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
154
click to vote
FPLE
1995
15 years 10 months ago
1995
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
149
click to vote
AIME
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Most test-selection algorithms currently in use with probabilistic networks select variables myopically, that is, test variables are selected sequentially, on a one-by-on...
160
click to vote
ECML
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
159
click to vote
HVC
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The s...