5055 search results - page 87 / 1011 » Relative Timing |
115
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The linear programming method is applied to the space Un(C) of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theore...
125
click to vote
ECCC
2008
15 years 2 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
111
Voted
ISQED
2003
IEEE
15 years 7 months ago
2003
IEEE
With continuing scaling of CMOS process, process variations in the form of die-to-die and within-die variations become significant which cause timing uncertainty. This paper prop...
79
Voted
ICCAD
2004
IEEE
15 years 11 months ago
2004
IEEE
With the increase of design complexities and the decrease of minimal feature sizes, IP reuse is becoming a common practice while crosstalk is becoming a critical issue that must b...
151
Voted
CONCUR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...