Sciweavers

1486 search results - page 186 / 298
» Algorithms for two-box covering
Sort
View
ISCAS
2003
IEEE
96views Hardware» more  ISCAS 2003»
15 years 9 months ago
A novel improvement technique for high-level test synthesis
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
Saeed Safari, Hadi Esmaeilzadeh, Amir-Hossein Jaha...
IWSOC
2003
IEEE
104views Hardware» more  IWSOC 2003»
15 years 9 months ago
IP Watermarking Techniques: Survey and Comparison
— Intellectual property (IP) block reuse is essential for facilitating the design process of System-on-a-Chip. Sharing IP blocks in such a competitive market poses significant h...
Amr T. Abdel-Hamid, Sofiène Tahar, El Mosta...
VTS
2003
IEEE
127views Hardware» more  VTS 2003»
15 years 9 months ago
Bist Reseeding with very few Seeds
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
Ahmad A. Al-Yamani, Subhasish Mitra, Edward J. McC...
CSCLP
2003
Springer
15 years 9 months ago
Clustering for Disconnected Solution Sets of Numerical CSPs
This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interv...
Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings
FCT
2003
Springer
15 years 9 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith