698 search results - page 11 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
140
Voted
UAI
1998
15 years 4 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
101
click to vote
FOCS
1997
IEEE
15 years 7 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
119
click to vote
DATE
2000
IEEE
15 years 6 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
112
click to vote
JUCS
2002
15 years 2 months ago
2002
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
125
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Inference in Markov Decision Processes has recently received interest as a means to infer goals of an observed action, policy recognition, and also as a tool to compute policies. ...