698 search results - page 9 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
156
click to vote
SOCO
2010
Springer
14 years 9 months ago
2010
Springer
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
188
click to vote
CP
1995
Springer
15 years 6 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
106
click to vote
AAAI
2004
15 years 4 months ago
2004
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...
105
click to vote
WCE
2007
15 years 4 months ago
2007
—The research efforts of the DECIDE Research Group have resulted in a decision tool capable of handling imprecise information in complex decision situations. Some of the research...
150
click to vote
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...