66 search results - page 6 / 14 » Optimal oblivious routing in polynomial time |
102
click to vote
ISPD
2009
ACM
15 years 6 months ago
2009
ACM
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...
ATMOS
2007
15 years 1 months ago
2007
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...
COLT
2004
Springer
15 years 5 months ago
2004
Springer
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...
EWSN
2004
Springer
15 years 11 months ago
2004
Springer
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...
EURODAC
1994
IEEE
15 years 3 months ago
1994
IEEE
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]...