Sciweavers

1165 search results - page 8 / 233
» Effective linear programming based placement methods
Sort
View
TC
2002
13 years 7 months ago
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
We present novel grid coverage strategies for effective surveillance and target location in distributed sensor networks. We represent the sensor field as a grid (two or three-dimen...
Krishnendu Chakrabarty, S. Sitharama Iyengar, Hair...
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
13 years 11 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
JNW
2006
126views more  JNW 2006»
13 years 7 months ago
Gateway Deployment optimization in Cellular Wi-Fi Mesh Networks
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...
Rajesh Prasad, Hongyi Wu
DAC
2003
ACM
14 years 8 months ago
An algebraic multigrid solver for analytical placement with layout based clustering
An efficient matrix solver is critical to the analytical placement. As the size of the matrix becomes huge, the multilevel methods turn out to be more efficient and more scalable....
Hongyu Chen, Chung-Kuan Cheng, Nan-Chi Chou, Andre...
DAC
2007
ACM
14 years 8 months ago
An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang