Sciweavers

16430 search results - page 391 / 3286
» On Computable Tree Functions
Sort
View
EPIA
2005
Springer
16 years 10 days ago
Adapting Peepholing to Regression Trees
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
Luís Torgo, Joana Marques
VECPAR
2004
Springer
16 years 4 days ago
Dynamically Adaptive Binomial Trees for Broadcasting in Heterogeneous Networks of Workstations
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...
Silvia M. Figueira, Christine Mendes
HPCA
1998
IEEE
15 years 11 months ago
Supporting Highly-Speculative Execution via Adaptive Branch Trees
Most of the prediction mechanisms predict a single path to continue the execution on a branch. Alternatively, we may exploit parallelism from either possible paths of a branch, di...
Tien-Fu Chen
DAC
1994
ACM
15 years 11 months ago
Rectilinear Steiner Trees with Minimum Elmore Delay
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCo...
DAC
2005
ACM
15 years 8 months ago
Minimizing peak current via opposite-phase clock tree
Although a lot of research efforts have been made in the minimization of the total power consumption caused by the clock tree, no attention has been paid to the minimization of th...
Yow-Tyng Nieh, Shih-Hsu Huang, Sheng-Yu Hsu