Sciweavers

1026 search results - page 13 / 206
» On Finding Minimal w-cutset
Sort
View
COCOON
2011
Springer
12 years 7 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
ECBS
2011
IEEE
197views Hardware» more  ECBS 2011»
12 years 7 months ago
Finding Interaction Faults Adaptively Using Distance-Based Strategies
Abstract—Software systems are typically large and exhaustive testing of all possible input parameters is usually not feasible. Testers select tests that they anticipate may catch...
Renée C. Bryce, Charles J. Colbourn, D. Ric...
DATE
2000
IEEE
75views Hardware» more  DATE 2000»
14 years 4 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
DSD
2003
IEEE
142views Hardware» more  DSD 2003»
14 years 1 months ago
FC-Min: A Fast Multi-Output Boolean Minimizer
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other approaches, the proposed method firstly finds the coverage of the on-sets and f...
Petr Fiser, Jan Hlavicka, Hana Kubatova
ISVLSI
2003
IEEE
157views VLSI» more  ISVLSI 2003»
14 years 1 months ago
Joint Minimization of Power and Area in Scan Testing by Scan Cell Reordering
This paper describes a technique for re-ordering of scan cells to minimize power dissipation that is also capable of reducing the area overhead of the circuit compared to a random...
Shalini Ghosh, Sugato Basu, Nur A. Touba