Sciweavers

1165 search results - page 104 / 233
» Effective linear programming based placement methods
Sort
View
130
Voted
CAD
2008
Springer
15 years 2 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
COR
2007
108views more  COR 2007»
15 years 2 months ago
A hub location problem with fully interconnected backbone and access networks
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
Tommy Thomadsen, Jesper Larsen
116
Voted
DAC
2003
ACM
16 years 3 months ago
Dynamic hardware/software partitioning: a first approach
Partitioning an application among software running on a microprocessor and hardware co-processors in on-chip configurable logic has been shown to improve performance and energy co...
Greg Stitt, Roman L. Lysecky, Frank Vahid
133
Voted
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 6 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
DBISP2P
2006
Springer
195views Database» more  DBISP2P 2006»
15 years 6 months ago
XML Query Routing in Structured P2P Systems
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
Leonidas Fegaras, Weimin He, Gautam Das, David Lev...