Sciweavers

515 search results - page 11 / 103
» A Reduced Complexity Algorithm for Minimizing N-Detect Tests
Sort
View
DATE
2000
IEEE
75views Hardware» more  DATE 2000»
14 years 25 days ago
Layout Compaction for Yield Optimization via Critical Area Minimization
This paper presents a new compaction algorithm to improve the yield of IC layout. The yield is improved by reducing the area where the faults are more likely to happen known as cr...
Youcef Bourai, C.-J. Richard Shi
ICCD
2004
IEEE
106views Hardware» more  ICCD 2004»
14 years 5 months ago
Extending the Applicability of Parallel-Serial Scan Designs
Although scan-based designs are widely used in order to reduce the complexity of test generation, test application time and test data volume are substantially increased. We propos...
Baris Arslan, Ozgur Sinanoglu, Alex Orailoglu
UAI
2004
13 years 9 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
JAIR
2010
153views more  JAIR 2010»
13 years 6 months ago
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
Michael Benisch, George B. Davis, Tuomas Sandholm
SENSYS
2003
ACM
14 years 1 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...