Sciweavers

624 search results - page 62 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
DAC
2010
ACM
15 years 8 months ago
Representative path selection for post-silicon timing prediction under variability
The identification of speedpaths is required for post-silicon (PS) timing validation, and it is currently becoming timeconsuming due to manufacturing variations. In this paper we...
Lin Xie, Azadeh Davoodi
IMR
2003
Springer
15 years 9 months ago
A Local Cell Quality Metric and Variational Grid Smoothing Algorithm
A local cell quality metric is introduced and used to construct a variational functional for a grid smoothing algorithm. A maximum principle is proved and the properties of the loc...
Larisa Branets, Graham F. Carey
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
16 years 4 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov
INFOCOM
2010
IEEE
15 years 2 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
APN
2006
Springer
15 years 6 months ago
Invariant Based Programming
Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verif...
Ralph-Johan Back