Sciweavers

29 search results - page 5 / 6
» GRIP: Global Routing via Integer Programming
Sort
View
INFOCOM
2009
IEEE
13 years 11 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
13 years 9 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
CN
2006
70views more  CN 2006»
13 years 4 months ago
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Abstract-- Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomou...
Anuj Rawat, Mark A. Shayman
ICC
2008
IEEE
139views Communications» more  ICC 2008»
13 years 11 months ago
Practical Routing and Channel Assignment Scheme for Mesh Networks with Directional Antennas
Abstract— Wireless Mesh Network (WMN) has been recognized as one of the promising technologies to provide wireless broadband access. In addition to the multi-radio multi-channel ...
Wei Zhou, Xi Chen, Daji Qiao
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
13 years 2 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...