Sciweavers

1228 search results - page 36 / 246
» Dynamic Highway-Node Routing
Sort
View
SIROCCO
1998
13 years 9 months ago
Characterization results of all shortest paths interval routing schemes
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
Michele Flammini, Giorgio Gambosi, Umberto Nanni, ...
ISCAPDCS
2003
13 years 9 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
EOR
2010
145views more  EOR 2010»
13 years 7 months ago
Robust and data-driven approaches to call centers
We propose both robust and data-driven approaches to a fluid model of call centers that incorporates random arrival rates with abandonment to determine staff levels and dynamic ro...
Dimitris Bertsimas, Xuan Vinh Doan
FPL
2008
Springer
138views Hardware» more  FPL 2008»
13 years 9 months ago
An efficient run-time router for connecting modules in FPGAS
It is often desirable to change the logic and/or the connections within an FPGA design on-the-fly without the benefit of a workstation or vendor CAD software. This paper presents ...
Jorge Surís, Cameron Patterson, Peter Athan...
IJCAI
2007
13 years 9 months ago
Waiting and Relocation Strategies in Online Stochastic Vehicle Routing
This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers...
Russell Bent, Pascal Van Hentenryck