656 search results - page 37 / 132 » Complexity of finite-horizon Markov decision process problem... |
112
click to vote
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
120
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
149
click to vote
ATAL
2011
Springer
14 years 1 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
120
Voted
CP
1998
Springer
15 years 6 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...