Sciweavers

138 search results - page 5 / 28
» Monitoring minimum cost paths on road networks
Sort
View
EOR
2008
106views more  EOR 2008»
14 years 9 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
15 years 9 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
COMCOM
2004
85views more  COMCOM 2004»
14 years 9 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
HOTOS
2003
IEEE
15 years 2 months ago
Virtual Appliances in the Collective: A Road to Hassle-Free Computing
This paper describes the vision of the Collective, a compute utility which runs internet services as well as the highly interactive applications we run on desktop computers today....
Constantine P. Sapuntzakis, Monica S. Lam
ISI
2007
Springer
15 years 3 months ago
Organizing Hot-Spot Police Patrol Routes
—We address the problem of planning patrol routes to maximize coverage of important locations (hot spots) at minimum cost (length of patrol route). We model a road network using ...
Sudarshan S. Chawathe