267 search results - page 12 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
VLSID
2002
IEEE
14 years 9 months ago
2002
IEEE
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...
FCT
2003
Springer
14 years 1 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
EVOW
2010
Springer
14 years 20 days ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
FCCM
2006
IEEE
14 years 2 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
GPCE
2007
Springer
14 years 16 days ago
2007
Springer
Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to AP...