2005 search results - page 160 / 401 » Decisive Markov Chains |
115
click to vote
NIPS
2004
15 years 3 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
118
click to vote
JMLR
2002
15 years 1 months ago
2002
We consider a finite-state Markov decision problem and establish the convergence of a special case of optimistic policy iteration that involves Monte Carlo estimation of Q-values,...
STOC
2002
ACM
16 years 1 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
108
click to vote
UAI
2000
15 years 3 months ago
2000
The K-Means and EM algorithms are popular in clustering and mixture modeling due to their simplicity and ease of implementation. However, they have several significant limitations...
112
click to vote
ISOLA
2010
Springer
15 years 3 days ago
2010
Springer
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...