Sciweavers

213 search results - page 7 / 43
» A parallel integer programming approach to global routing
Sort
View
EOR
2007
78views more  EOR 2007»
13 years 7 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
ICPP
2000
IEEE
13 years 12 months ago
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an ...
Jie Wu
ISPAN
2002
IEEE
14 years 11 days ago
On the Impact of Naming Methods for Heap-Oriented Pointers in C Programs
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
14 years 4 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
IFIP
2005
Springer
14 years 29 days ago
Global Internet Routing Forensics: Validation of BGP Paths Using ICMP Traceback
Nearly all network applications rely on the global Internet routing infrastructure to compute routes and deliver packets. Unfortunately, false Internet routes can be maliciously in...
Eunjong Kim, Daniel Massey, Indrajit Ray