55 search results - page 5 / 11 » Bounds on pseudoexhaustive test lengths |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
CC
2008
Springer
13 years 7 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
ATS
2005
IEEE
14 years 1 months ago
2005
IEEE
— Structural transformation of a design to enhance its testability while satisfying design constraints on power and performance, can result in improved test cost and test confid...
DAC
2012
ACM
11 years 9 months ago
2012
ACM
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...