2005 search results - page 202 / 401 » Decisive Markov Chains |
100
Voted
ICCAD
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
140
click to vote
ICML
1995
IEEE
16 years 2 months ago
1995
IEEE
Partially observable Markov decision processes (pomdp's) model decision problems in which an agent tries to maximize its reward in the face of limited and/or noisy sensor fee...
133
click to vote
ALT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
108
click to vote
ICTAI
2005
IEEE
15 years 7 months ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
129
click to vote
AAAI
1996
15 years 3 months ago
1996
Markov decision processes (MDPs) are a very popular tool for decision theoretic planning (DTP), partly because of the welldeveloped, expressive theory that includes effective solu...