36 search results - page 3 / 8 » Exploiting local and repeated structure in Dynamic Bayesian ... |
CONEXT
2009
ACM
13 years 8 months ago
2009
ACM
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
AI
2000
Springer
13 years 7 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
CMSB
2009
Springer
14 years 2 months ago
2009
Springer
Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic appro...
AAAI
2006
13 years 8 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
FLAIRS
2001
13 years 8 months ago
2001
When constructing a Bayesian network, it can be advantageous to employ structural learning algorithms to combine knowledge captured in databases with prior information provided by...