1277 search results - page 16 / 256 » Terminating Decision Algorithms Optimally |
105
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
Presynthesis optimizations transform a behavioral HDL description into an optimized HDL description that results in improved synthesis results. In this paper we introduce the decom...
141
click to vote
AUSAI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper presents a formulation of an optimality principle for a new class of concurrent decision systems formed by products of deterministic Markov decision processes ...
120
click to vote
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
142
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
We give an optimal dynamic programming algorithm to solve a class of finite-horizon decentralized Markov decision processes (MDPs). We consider problems with a broadcast informati...
165
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....