6045 search results - page 144 / 1209 » Computable Linearizations of Well-partial-orderings |
DAC
1996
ACM
14 years 7 days ago
1996
ACM
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
CPM
2008
Springer
13 years 10 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
VLSID
2007
IEEE
14 years 8 months ago
2007
IEEE
Piecewise linear branch predictor has been demonstrated to have superior prediction accuracy; however, its huge hardware overhead prevents the predictor from being practical in the...
ICPADS
2007
IEEE
14 years 2 months ago
2007
IEEE
Min, Veeravalli, and Barlas have recently proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one...