Sciweavers

366 search results - page 37 / 74
» Circuit optimization using statistical static timing analysi...
Sort
View
POPL
2007
ACM
16 years 3 days ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
UAI
1996
15 years 1 months ago
Topological parameters for time-space tradeoff
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
Rina Dechter
ICCAD
2009
IEEE
152views Hardware» more  ICCAD 2009»
14 years 9 months ago
Adaptive sampling for efficient failure probability analysis of SRAM cells
In this paper, an adaptive sampling method is proposed for the statistical SRAM cell analysis. The method is composed of two components. One part is the adaptive sampler that manip...
Javid Jaffari, Mohab Anis
ICDE
2005
IEEE
102views Database» more  ICDE 2005»
16 years 1 months ago
Modeling and Managing Content Changes in Text Databases
Large amounts of (often valuable) information are stored in web-accessible text databases. "Metasearchers" provide unified interfaces to query multiple such databases at...
Panagiotis G. Ipeirotis, Alexandros Ntoulas, Jungh...
CSUR
1999
114views more  CSUR 1999»
14 years 11 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot