Results 281 to 290 of about 118,666 (308)
Some of the next articles are maybe not open access.
Computing shortest paths with uncertainty
Journal of Algorithms, 2003We 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
Tomás Feder +4 more
openaire +1 more source
GPU computing for accelerating the numerical Path Integration approach [PDF]
Computers and Structures, 2016 The paper discusses a novel approach of accelerating the numerical Path Integration method, used for generating a stationary joint response probability density function of a dynamic system subjected to a random excitation, by the GPU computing. The paper
Panagiotis Alevras, Daniil Yurchenko
exaly +3 more sources
An algorithm to compute collusion paths
Proceedings of INFOCOM '97, 2002In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting from their initial knowledge, and have presented a complete solution for a special case of the problem.
Steven H. Low, Nicholas F. Maxemchuk
openaire +1 more source
On the scalability of interdomain path computations
2014 IFIP Networking Conference, 2014Recent research has considered various architectural approaches in which route determination occurs separately from forwarding. Such offers many advantages, but also brings a number of challenges, not least of which is scalability. In this paper we consider the problem of computing domain-level end-to-end routes in the Internet.
Onur Ascigil +2 more
openaire +1 more source
Path Length Computations on Graph Models of Computations
IEEE Transactions on Computers, 1969This 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.
David F. Martin, Gerald Estrin
openaire +1 more source
Intricacies of quantum computational paths
Quantum Information Processing, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luís Tarrataca, Andreas Wichert
openaire +2 more sources
Scalable approaches for path computation
2015 17th International Conference on Transparent Optical Networks (ICTON), 2015Optimal 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 +4 more
openaire +1 more source
Computing Constrained Shortest-Paths at Scale
Operations Research, 2022Motivated by the needs of modern transportation service platforms, we study the problem of computing constrained shortest paths (CSP) at scale via preprocessing techniques. Our work makes two contributions in this regard: 1) We propose a scalable algorithm for CSP queries and show how its performance can be parametrized in terms of a new network ...
Alberto Vera +2 more
openaire +2 more sources
Crowdsourcing computing resources for shortest-path computation
Proceedings of the 20th International Conference on Advances in Geographic Information Systems, 2012Crowdsourcing 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 ...
Alexandros Efentakis +2 more
openaire +1 more source
Computing almost shortest paths
ACM Transactions on Algorithms, 2001We study the <i>s-sources almost shortest paths</i> (abbreviated <i>s-ASP</i>) problem. Given an unweighted graph <i>G</i> = (<i>V,E</i>), and a subset <i>S</i> ⊆ <i>V</i> of <i>s</i> nodes, the goal is to compute almost shortest paths between all ...
openaire +1 more source