1277 search results - page 144 / 256 » Terminating Decision Algorithms Optimally |
132
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
121
click to vote
JCP
2008
15 years 3 months ago
2008
Under the environment of Service-Oriented Architecture (SOA), service users have to decide how to choose the proper provider from the candidates to obtain optimal service level. Th...
153
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
141
click to vote
IJCAI
2003
15 years 5 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
149
Voted
ICML
1998
IEEE
16 years 4 months ago
1998
IEEE
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...