Sciweavers

79 search results - page 7 / 16
» Global Routing with Crosstalk Constraints
Sort
View
ANOR
2011
214views more  ANOR 2011»
13 years 4 months ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
DAC
2007
ACM
14 years 10 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
DAC
2003
ACM
14 years 3 months ago
Force directed mongrel with physical net constraints
This paper describes a new force directed global placement algorithm that exploits and extends techniques from two leading placers, Force-directed [12] [26] and Mongrel [22]. It c...
Sung-Woo Hur, Tung Cao, Karthik Rajagopal, Yegna P...
ICNP
2007
IEEE
14 years 4 months ago
Geographically Informed Inter-Domain Routing
Abstract— We propose to add geographic location information into BGP routing updates to enable Geographically Informed Inter-Domain Routing (GIRO). GIRO departs from previous geo...
Ricardo V. Oliveira, Mohit Lad, Beichuan Zhang, Li...
SIGCOMM
2004
ACM
14 years 3 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra