Sciweavers

257 search results - page 38 / 52
» An optimal algorithm for area minimization of slicing floorp...
Sort
View
ISPD
1998
ACM
101views Hardware» more  ISPD 1998»
14 years 4 days ago
Greedy wire-sizing is linear time
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...
Chris C. N. Chu, D. F. Wong
AIR
2005
114views more  AIR 2005»
13 years 7 months ago
Airport Gate Scheduling with Time Windows
In contrast to the existing airport gate assignment studies where flight have fixed schedules, we consider the more realistic situation where flight arrival and departure times can...
Andrew Lim, Brian Rodrigues, Yi Zhu
EJWCN
2010
157views more  EJWCN 2010»
13 years 2 months ago
Distributed Power Allocation for Parallel Broadcast Channels with Only Common Information in Cognitive Tactical Radio Networks
A tactical radio network is a radio network in which a transmitter broadcasts the same information to its receivers. In this paper, dynamic spectrum management is studied for multi...
Vincent Le Nir, Bart Scheers
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 1 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen