206 search results - page 17 / 42 » Probabilistic Analysis of Large Finite State Machines |
JMLR
2008
14 years 11 months ago
2008
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
ICML
2009
IEEE
16 years 15 days ago
2009
IEEE
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
ICDT
2003
ACM
15 years 4 months ago
2003
ACM
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
106
click to vote
ICML
2006
IEEE
16 years 15 days ago
2006
IEEE
A family of probabilistic time series models is developed to analyze the time evolution of topics in large document collections. The approach is to use state space models on the n...
102
click to vote
ISSRE
2002
IEEE
15 years 4 months ago
2002
IEEE
A number of strategies have been proposed for state-based class testing. An important proposal was made by Chow [5] and adapted by Binder [3]: It consists in deriving test sequenc...