2343 search results - page 159 / 469 » The Locomotive Routing Problem |
163
click to vote
PCI
2005
Springer
15 years 11 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
180
click to vote
NETWORKING
2008
15 years 7 months ago
2008
Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...
197
click to vote
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
132
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
160
click to vote
COR
2007
15 years 6 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...