Sciweavers

624 search results - page 58 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
15 years 9 months ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
ISSRE
2003
IEEE
15 years 9 months ago
Augmenting Simulated Annealing to Build Interaction Test Suites
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...
GECCO
1999
Springer
15 years 8 months ago
Terrain-Based Genetic Algorithm (TBGA): Modeling Parameter Space as Terrain
The Terrain-Based Genetic Algorithm (TBGA) is a self-tuning version of the traditional Cellular Genetic Algorithm (CGA). In a TBGA, various combinations of parameter values appear...
V. Scott Gordon, Rebecca Pirie, Adam Wachter, Scot...
BCSHCI
2008
15 years 5 months ago
User test of soccer highlights application
This paper describes an evaluation of a consumer application for soccer highlights detection, which combines advanced user interaction with an underlying automatic highlights dete...
Lu Wang, Pedro Fonseca, Bas Zoetekouw
JAMDS
2002
155views more  JAMDS 2002»
15 years 3 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner