Results 301 to 310 of about 973,180 (337)

Computing shortest paths with uncertainty

Journal of Algorithms, 2003
We consider the problem of estimating the length of the shortest path from a vertex s to a vertex t in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Initially, for each edge e, the length of e is known only to lie within an interval [l"e,h"e]; the estimation algorithm can pay w"e to find the exact length
Liadan O'Callaghan, Christopher Olston, Rajeev Motwani, Tomás Feder, Rina Panigrahy   +4 more
openaire   +2 more sources

Crowdsourcing computing resources for shortest-path computation

Proceedings of the 20th International Conference on Advances in Geographic Information Systems, 2012
Crowdsourcing road network data, i.e., involving users to collect data including the detection and assessment of changes to the road network graph, poses a challenge to shortest-path algorithms that rely on preprocessing. Hence, current research challenges lie with improving performance by adequately balancing preprocessing with respect to fast ...
Efentakis A., Theodorakis D., Pfoser D.
openaire   +2 more sources

Path Length Computations on Graph Models of Computations

IEEE Transactions on Computers, 1969
This paper discusses essential difficulties in calculating mean path lengths on a directed graph model of computations. This study was part of a larger study of a priori scheduling of computer programs in a parallel processing environment. Efficient approximations to mean processing time (mean path length) of programs in such an environment are given.
D.F. Martin, G. Estrin
openaire   +2 more sources

Scalable approaches for path computation

2015 17th International Conference on Transparent Optical Networks (ICTON), 2015
Optimal and fast approaches for path computation are of paramount importance especially for the path computation elements (PCE) of generalized multi-protocol label switching (GMPLS) networks. To overcome the computational complexity, optimality must be traded for the execution time, enabling scalable computation.
CERUTTI, Isabella, Bruno, G., Lazzeri, F., Nijhof, J., CASTOLDI, Piero   +4 more
openaire   +2 more sources

SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS [PDF]

International Journal of Computational Geometry & Applications, 1996
We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the ...
Jindong Chen, Yijie Han
openaire   +1 more source

Fastest-Path Computation

2008
Definition In the United states, only 9.3% of the households do not have cars. Driving is part of people’s daily life. GIS systems like MapQuest and MapPoint are heavily relied on to provide driving directions. However, surprisingly enough, existing systems either ignore the driving speed on road networks, or assume the speed remains constant on the ...
openaire   +2 more sources

The Path Computation Element (PCE)

2015
The Internet Engineering Task Force (IETF) has promoted the Path Computation Element (PCE) architecture to provide effective network resource utilization while guaranteeing advanced Internet applications with adequate quality of service (QoS). The PCE is a dedicated network entity devoted to path computation.
PAOLUCCI, Francesco, CUGINI, FILIPPO
openaire   +1 more source

Computing almost shortest paths

ACM Transactions on Algorithms, 2001
We study the <i>s-sources almost shortest paths</i> (abbreviated <i>s-ASP</i>) problem. Given an unweighted graph <i>G</i> &equals; (<i>V,E</i>), and a subset <i>S</i> &sube; <i>V</i> of <i>s</i> nodes, the goal is to compute almost shortest paths between all ...
openaire   +3 more sources