698 search results - page 15 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
CCE
2005
14 years 9 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
COCO
2000
Springer
15 years 1 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...