Sciweavers

9842 search results - page 1777 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ISCAS
2008
IEEE
110views Hardware» more  ISCAS 2008»
15 years 10 months ago
Non-traditional irregular interconnects for massive scale SoC
— By using self-assembling fabrication techniques at the cellular, molecular, or atomic scale, it is nowadays possible to create functional assemblies in a mainly bottom-up way t...
Christof Teuscher, Anders A. Hansson
ISVLSI
2008
IEEE
173views VLSI» more  ISVLSI 2008»
15 years 10 months ago
Hermes-GLP: A GALS Network on Chip Router with Power Control Techniques
The evolution of deep submicron technologies allows the development of increasingly complex Systems on a Chip (SoC). However, this evolution is rendering less viable some well-est...
Julian J. H. Pontes, Matheus T. Moreira, Rafael So...
PDP
2008
IEEE
15 years 10 months ago
Routing Performance in a Hierarchical DHT-based Overlay Network
The scalability properties of DHT based overlay networks is considered satisfactory. However, in large scale systems this might still cause a problem since they have a logarithmic...
Isaías Martinez-Yelmo, Rubén Cuevas ...
RSP
2008
IEEE
120views Control Systems» more  RSP 2008»
15 years 10 months ago
Co-design Architecture and Implementation for Point-Based Rendering on FPGAs
Current graphic cards include advanced graphic processing units to accelerate the rendering of 3D objects with millions of polygons. As object models grow in complexity, the rende...
Mateusz Majer, Stefan Wildermann, Josef Angermeier...
RTSS
2008
IEEE
15 years 10 months ago
Merging State and Preserving Timing Anomalies in Pipelines of High-End Processors
Many embedded systems are subject to temporal constraints that require advance guarantees on meeting deadlines. Such systems rely on static analysis to safely bound worst-case exe...
Sibin Mohan, Frank Mueller
« Prev « First page 1777 / 1969 Last » Next »