Sciweavers

6111 search results - page 87 / 1223
» Time, Hardware, and Uniformity
Sort
View
IJCM
2002
73views more  IJCM 2002»
13 years 8 months ago
Space-Time Equations for Non-Unimodular Mappings
Abstract. The class of systems of uniform recurrence equations (UREs) is closed under unimodular transformations. As a result, every systolic array described by a unimodular mappin...
Jingling Xue, Patrick M. Lenders
ISQED
2006
IEEE
85views Hardware» more  ISQED 2006»
14 years 3 months ago
Pessimism Reduction In Static Timing Analysis Using Interdependent Setup and Hold Times
— A methodology is proposed for interdependent setup time and hold time characterization of sequential circuits. Integrating the methodology into an industrial sign-off static ti...
Emre Salman, Eby G. Friedman, Ali Dasdan, Feroze T...
ETS
2006
IEEE
89views Hardware» more  ETS 2006»
14 years 21 days ago
On-Chip Time Measurement Architecture with Femtosecond Timing Resolution
This paper presents a new on-chip time measurement architecture which is based on the Timeto-Digital Conversion (TDC) method that is capable of achieving a timing resolution of te...
Matthew Collins, Bashir M. Al-Hashimi
VMCAI
2010
Springer
14 years 6 months ago
Complexity Bounds for the Verification of Real-Time Software
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
DAM
2006
79views more  DAM 2006»
13 years 9 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean