1277 search results - page 72 / 256 » Terminating Decision Algorithms Optimally |
106
click to vote
DAWAK
1999
Springer
15 years 7 months ago
1999
Springer
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
112
click to vote
ENGL
2006
15 years 3 months ago
2006
We describe in this paper the use of neural networks, fuzzy logic and genetic algorithms for voice recognition. In particular, we consider the case of speaker recognition by analyz...
154
click to vote
PRICAI
2000
Springer
15 years 6 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
117
click to vote
PDP
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract—Among the numerous DAG scheduling heuristics suitable for heterogeneous systems, the Heterogeneous Earliest Finish Time (HEFT) heuristic is known to give good results in...
133
click to vote
ECSQARU
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...