AISpace2 Main Tools News Downloads Prototype Tools Customizable Applets Practice Exercises Help About AIspace

How does the time complexity of exact inference in a Markov chain depend on the number of time steps? The time complexity is linear, since the Markov property makes it possible to calculate probabilities for each time step directly from the previous step. This stands in contrast to variable elimination in general belief networks.

Main Tools: Graph Searching | Consistency for CSP | SLS for CSP | Deduction | Belief and Decision Networks | Decision Trees | Neural Networks | STRIPS to CSP