Sciweavers

229 search results - page 7 / 46
» Compaction Schemes with Minimum Test Application Time
Sort
View
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
IPPS
2000
IEEE
14 years 12 days ago
Speed vs. Accuracy in Simulation for I/O-Intensive Applications
This paper presents a family of simulators that have been developed for data-intensive applications, and a methodology to select the most efficient one based on a usersupplied req...
Hyeonsang Eom, Jeffrey K. Hollingsworth
COMPGEOM
2005
ACM
13 years 10 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
ICCAD
1999
IEEE
86views Hardware» more  ICCAD 1999»
14 years 9 days ago
A framework for testing core-based systems-on-a-chip
Available techniques for testing core-based systems-on-a-chip (SOCs) do not provide a systematic means for synthesising low-overhead test architectures and compact test solutions....
Srivaths Ravi, Ganesh Lakshminarayana, Niraj K. Jh...
DATE
2006
IEEE
94views Hardware» more  DATE 2006»
14 years 2 months ago
Reuse-based test access and integrated test scheduling for network-on-chip
In this paper, we propose a new method for test access and test scheduling in NoC-based system. It relies on a progressive reuse of the network resources for transporting test dat...
Chunsheng Liu, Zach Link, Dhiraj K. Pradhan