515 search results - page 17 / 103 » A Reduced Complexity Algorithm for Minimizing N-Detect Tests |
INFORMATICALT
2006
13 years 8 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
ISPD
2000
ACM
14 years 24 days ago
2000
ACM
Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3 ) complexity,...
NIPS
2004
13 years 9 months ago
2004
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
TCOM
2010
13 years 3 months ago
2010
In this letter we propose linear non-regenerative multicarrier multiple-input multiple-output (MIMO) relay technique that aims to minimize the mean-squared error (MSE) of the signa...
ETS
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper we address the test scheduling problem for Builtin Self-tested (BISTed) embedded SRAMs (e-SRAMs) when Data Retention Faults (DRFs) are considered. The proposed test ...