515 search results - page 6 / 103 » Approximating Markov Processes by Averaging |
IJCAI
2001
13 years 8 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
NIPS
2007
13 years 8 months ago
2007
Markov jump processes play an important role in a large number of application domains. However, realistic systems are analytically intractable and they have traditionally been ana...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
RSKT
2010
Springer
13 years 5 months ago
2010
Springer
Traditionally, membership to the fuzzy-rough lower, resp. upper approximation is determined by looking only at the worst, resp. best performing object. Consequently, when applied t...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding th...