1277 search results - page 49 / 256 » Terminating Decision Algorithms Optimally |
139
click to vote
UAI
2000
15 years 4 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
123
click to vote
IJAR
2006
15 years 3 months ago
2006
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
144
click to vote
CODES
2003
IEEE
15 years 8 months ago
2003
IEEE
In the Sesame framework, we develop a modeling and simulation environment for the efficient design space exploration of heterogeneous embedded systems. Since Sesame recognizes se...
135
click to vote
DATE
2006
IEEE
15 years 9 months ago
2006
IEEE
Quantum information processing technology is in its pioneering stage and no proficient method for synthesizing quantum circuits has been introduced so far. This paper introduces a...
111
Voted
APLAS
2003
ACM
15 years 8 months ago
2003
ACM
This paper studies the problem of resource availability in the context of mobile code for embedded systems such as smart cards. It presents an architecture dedicated to controlling...