1640 search results - page 24 / 328 » Conditional Independence Trees |
RC
2007
13 years 9 months ago
2007
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events,...
COLING
2002
13 years 9 months ago
2002
We describe a mechanism for the interpretation of arguments, which can cope with noisy conditions in terms of wording, beliefs and argument structure. This is achieved through the...
SPAA
2006
ACM
14 years 3 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
ORL
2007
13 years 9 months ago
2007
The unichain condition requires that every policy in an MDP result in a single ergodic class, and guarantees that the optimal average cost is independent of the initial state. We ...
FLAIRS
2007
14 years 5 days ago
2007
In this paper, we study the problem of information preservation when decomposing a single Bayesian network into a set of smaller Bayesian networks. We present a method that lossle...