Sciweavers

83 search results - page 10 / 17
» Arc routing problems with time-dependent service costs
Sort
View
4OR
2010
148views more  4OR 2010»
13 years 6 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
GIS
2003
ACM
14 years 8 months ago
Processing in-route nearest neighbor queries: a comparison of alternative approaches
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
Shashi Shekhar, Jin Soung Yoo
MASCOTS
2001
13 years 9 months ago
PTPlan MPLS: A Tool for MPLS Network Dimensioning
This paper presents a tool for MPLS network dimensioning that allows for multi-hour dimensioning of networks supporting simultaneously peer-to-peer and client-server services. The...
Luís Cardoso, Jorge Patrão, Carlos L...
INFOCOM
1998
IEEE
13 years 12 months ago
QoS Routing in Networks with Uncertain Parameters
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
Dean H. Lorenz, Ariel Orda
BROADNETS
2007
IEEE
14 years 2 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta