1591 search results - page 94 / 319 » Hybrid decision tree |
ALT
2010
Springer
13 years 11 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
TOC
2010
13 years 4 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
MP
2006
13 years 9 months ago
2006
We address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time o...
KI
2007
Springer
13 years 9 months ago
2007
Springer
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
HCW
1998
IEEE
14 years 1 months ago
1998
IEEE
A heterogeneous computing system provides a variety of different machines, orchestrated to perform an application whose subtasks have diverse execution requirements. The subtasks ...