3600 search results - page 54 / 720 » The settling-time reducibility ordering |
HPCA
2007
IEEE
14 years 10 months ago
2007
IEEE
If-conversion is a compiler technique that reduces the misprediction penalties caused by hard-to-predict branches, transforming control dependencies into data dependencies. Althou...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
SIAMSC
2010
13 years 8 months ago
2010
This paper develops a nested iteration algorithm to solve time-dependent nonlinear systems of partial differential equations. For each time step, Newton’s method is used to form...
ICCAD
1995
IEEE
14 years 1 months ago
1995
IEEE
This paper presents a linear time algorithm to reduce a large RC interconnect network into subnetworks which are approximated with lower order equivalent RC circuits. The number o...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Simplification of mixture models has recently emerged as an important issue in the field of statistical learning. The heavy computational demands of using large order models dro...