708 search results - page 33 / 142 » Timing closure: the solution and its problems |
DGCI
2009
Springer
15 years 1 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
RTSS
1995
IEEE
15 years 1 months ago
1995
IEEE
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...
FSTTCS
1992
Springer
15 years 2 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
COR
2007
14 years 9 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
ICDCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the problem of sending messages into the future, commonly known as timed release cryptography. Existing schemes for this task either solve the relative time problem wi...