Sciweavers

229 search results - page 8 / 46
» Compaction Schemes with Minimum Test Application Time
Sort
View
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
13 years 9 months ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
GLOBECOM
2007
IEEE
13 years 12 months ago
CAC for Multibeam Opportunistic Schemes in Heterogeneous WiMax Systems Under QoS Constraints
Spatial scheduling in a heterogeneous WiMax Downlink channel, based on partial Channel State Information at the Transmitter (CSIT), is carried out through a multibeam opportunistic...
Nizar Zorba, Ana I. Pérez-Neira
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 8 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
VTS
2003
IEEE
122views Hardware» more  VTS 2003»
14 years 1 months ago
A Reconfigurable Shared Scan-in Architecture
In this paper, an efficient technique for test data volume reduction based on the shared scan-in (Illinois Scan) architecture and the scan chain reconfiguration (Dynamic Scan) arc...
Samitha Samaranayake, Emil Gizdarski, Nodari Sitch...
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
14 years 8 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne