2467 search results - page 268 / 494 » Finite State Machines |
182
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
159
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
182
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object...
149
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Partially Observable Markov Decision Processes (POMDPs) have succeeded in planning domains that require balancing actions that increase an agent's knowledge and actions that ...
198
click to vote
ICML
2006
IEEE
16 years 7 months 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...