3415 search results - page 288 / 683 » Lower bounds on kernelization |
164
click to vote
WAOA
2004
Springer
16 years 2 days 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...
138
click to vote
ITC
2003
IEEE
16 years 45 min 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....
178
click to vote
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...
168
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...