Sciweavers

229 search results - page 14 / 46
» Compaction Schemes with Minimum Test Application Time
Sort
View
CASES
2010
ACM
13 years 6 months ago
Real-time unobtrusive program execution trace compression using branch predictor events
Unobtrusive capturing of program execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited program segments is often cost-prohibi...
Vladimir Uzelac, Aleksandar Milenkovic, Martin Bur...
AAAI
2007
13 years 10 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
TVLSI
2008
133views more  TVLSI 2008»
13 years 8 months ago
Test Data Compression Using Selective Encoding of Scan Slices
We present a selective encoding method that reduces test data volume and test application time for scan testing of Intellectual Property (IP) cores. This method encodes the slices ...
Zhanglei Wang, Krishnendu Chakrabarty
VTS
2002
IEEE
138views Hardware» more  VTS 2002»
14 years 28 days ago
Test Power Reduction through Minimization of Scan Chain Transitions
Parallel test application helps reduce the otherwise considerable test times in SOCs; yet its applicability is limited by average and peak power considerations. The typical test v...
Ozgur Sinanoglu, Ismet Bayraktaroglu, Alex Orailog...
FOCS
2009
IEEE
14 years 2 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi