Sciweavers

66 search results - page 6 / 14
» Optimal oblivious routing in polynomial time
Sort
View
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 2 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 9 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
COLT
2004
Springer
14 years 24 days ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
EWSN
2004
Springer
14 years 7 months ago
Max-Min Length-Energy-Constrained Routing in Wireless Sensor Networks
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishab...
Rajgopal Kannan, Lydia Ray, Ramaraju Kalidindi, S....
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
13 years 11 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan