Sciweavers

3946 search results - page 191 / 790
» The computational complexity of choice sets
Sort
View
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
16 years 29 days ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
SC
2004
ACM
16 years 1 days ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich
HPCN
1999
Springer
15 years 11 months ago
Computational Experiments using Distributed Tools in a Web-Based Electronic Notebook Environment
Abstract. Computational environments used by scientists should provide high-level support for scientific processes that involve the integrated ematic use of familiar abstractions f...
Allen D. Malony, Jenifer L. Skidmore, Matthew J. S...
SI3D
2006
ACM
16 years 17 days ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
DAC
1999
ACM
15 years 11 months ago
Common-Case Computation: A High-Level Technique for Power and Performance Optimization
This paper presents a design methodology, called common-case computation (CCC), and new design automation algorithms for optimizing power consumption or performance. The proposed ...
Ganesh Lakshminarayana, Anand Raghunathan, Kamal S...