3208 search results - page 266 / 642 » A Lower Bound for Primality |
141
click to vote
CRYPTO
2005
Springer
16 years 6 days ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
162
click to vote
WAOA
2004
Springer
16 years 2 hour ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
137
click to vote
ITC
2003
IEEE
15 years 12 months ago
2003
IEEE
Intermittent scan chain hold-time fault is discussed in this paper and a method to diagnose the faulty site in a scan chain is proposed as well. Unlike the previous scan chain dia...
176
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
176
Voted
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...