83 search results - page 5 / 17 » Arc routing problems with time-dependent service costs |
ICNS
2009
IEEE
13 years 5 months ago
2009
IEEE
Recent research on overlay networks has revealed that user-perceived network performance could be improved by an overlay routing mechanism. The effectiveness of overlay routing is ...
IOR
2006
13 years 7 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
INFOCOM
2003
IEEE
14 years 28 days ago
2003
IEEE
—A methodology is presented for integrating effective-bandwidth-based routing for QoS-sensitive traffic and datagram routing of the best-effort traffic. To prevent excessive dela...