Sciweavers

598 search results - page 80 / 120
» The Puzzle Layout Problem
Sort
View
DAC
2001
ACM
14 years 8 months ago
Performance-Driven Multi-Level Clustering with Application to Hierarchical FPGA Mapping
In this paper, we study the problem of performance-driven multi-level circuit clustering with application to hierarchical FPGA designs. We first show that the performance-driven m...
Jason Cong, Michail Romesis
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 4 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White
DSN
2007
IEEE
14 years 2 months ago
An Architectural Approach to Preventing Code Injection Attacks
Code injection attacks, despite being well researched, continue to be a problem today. Modern architectural solutions such as the NX-bit and PaX have been useful in limiting the a...
Ryan Riley, Xuxian Jiang, Dongyan Xu
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
14 years 1 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
ECAL
2001
Springer
14 years 6 days ago
Amorphous Geometry
Amorphous computing is a recently introduced paradigm that favours geometrical configurations. The physical layout of an amorphous computer is based on a possibly irregular and er...
Ellie D'Hondt, Theo D'Hondt