515 search results - page 32 / 103 » A Reduced Complexity Algorithm for Minimizing N-Detect Tests |
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
In this paper, we propose a novel method to reduce the magnitude of 4D CT artifacts by stitching two images with a data-driven regularization constrain, which helps preserve the l...
AI
2006
Springer
14 years 6 days ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
DATE
2005
IEEE
14 years 2 months ago
2005
IEEE
Overheating has been acknowledged as a major issue in testing complex SOCs. Several power constrained system-level DFT solutions (power constrained test scheduling) have recently ...
ASPDAC
2006
ACM
14 years 6 days ago
2006
ACM
- We propose a framework to unify the process of false paths and multi-cycle paths in static timing analysis (STA). We use subgraphs attached with timing constraints to represent f...