Sciweavers

589 search results - page 53 / 118
» On the Use of Combining Rules in Relational Probability Tree...
Sort
View
ENTCS
2007
143views more  ENTCS 2007»
15 years 1 months ago
Formal Fault Tree Analysis - Practical Experiences
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
Frank Ortmeier, Gerhard Schellhorn
IAT
2008
IEEE
15 years 8 months ago
Finding Minimum Data Requirements Using Pseudo-independence
In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context ...
Yoonheui Kim, Victor R. Lesser
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 2 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
PODS
2008
ACM
143views Database» more  PODS 2008»
16 years 1 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
ICFP
2005
ACM
16 years 1 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...