515 search results - page 50 / 103 » Approximating Markov Processes by Averaging |
156
Voted
NIPS
2000
15 years 7 months ago
2000
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
162
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
173
click to vote
UAI
2004
15 years 7 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
144
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
- Advanced process technologies impose more significant challenges especially when manufactured circuits exhibit substantial process variations. Consideration of process variations...
177
click to vote
ICSE
2003
IEEE-ACM
15 years 11 months ago
2003
IEEE-ACM
Improvements in the software development process depend on our ability to collect and analyze data drawn from various phases of the development life cycle. Our design metrics rese...