Sciweavers

16404 search results - page 183 / 3281
» A set coverage problem
Sort
View
110
Voted
ICCAD
2006
IEEE
141views Hardware» more  ICCAD 2006»
16 years 13 days ago
Algorithms for MIS vector generation and pruning
Ignoring the effect of simultaneous switching for logic gates causes silicon failures for high performance microprocessor designs. The main reason to omit this effect is the run...
Kenneth S. Stevens, Florentin Dartu
101
Voted
DATE
2005
IEEE
126views Hardware» more  DATE 2005»
15 years 9 months ago
The Accidental Detection Index as a Fault Ordering Heuristic for Full-Scan Circuits
We investigate a new fault ordering heuristic for test generation in full-scan circuits. The heuristic is referred to as the accidental detection index. It associates a value ADI ...
Irith Pomeranz, Sudhakar M. Reddy
126
Voted
DAGSTUHL
2008
15 years 5 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
128
Voted
ESA
2005
Springer
136views Algorithms» more  ESA 2005»
15 years 9 months ago
Approximating the 2-Interval Pattern Problem
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
Maxime Crochemore, Danny Hermelin, Gad M. Landau, ...
COR
2006
86views more  COR 2006»
15 years 3 months ago
Heuristics for a bidding problem
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu