Sciweavers

1640 search results - page 227 / 328
» Conditional Independence Trees
Sort
View
CCE
2008
13 years 9 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
IANDC
2008
122views more  IANDC 2008»
13 years 8 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
CN
2006
74views more  CN 2006»
13 years 8 months ago
OMNI: An efficient overlay multicast infrastructure for real-time applications
We consider an overlay architecture (called OMNI) where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming appli...
Suman Banerjee, Christopher Kommareddy, Koushik Ka...
ENTCS
2006
134views more  ENTCS 2006»
13 years 8 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
IJAR
2006
98views more  IJAR 2006»
13 years 8 months ago
Inference in hybrid Bayesian networks with mixtures of truncated exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for solving hybrid Bayesian networks. Any probability density function can be approximated...
Barry R. Cobb, Prakash P. Shenoy