1461 search results - page 275 / 293 » Complexity of Graph Covering Problems |
INFORMATICALT
2007
13 years 7 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
TCAD
2008
13 years 7 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
TMI
2008
13 years 7 months ago
2008
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
JPDC
2007
13 years 7 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
JSA
1998
13 years 7 months ago
1998
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...