Results 241 to 250 of about 1,024,245 (290)

Accelerating mesh-based Monte Carlo simulations using contemporary graphics ray-tracing hardware. [PDF]

J Biomed Opt
Yan S, Dwyer D, Kaeli DR, Fang Q.
europepmc   +1 more source

Novel representation of complexity of investment casting using injective coloring and graph adaptive consensus mechanism. [PDF]

Sci Rep
Mobarsa D, Shukla M, Maheta N, Sata A, Jarboui S.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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
T. Feder, R. Motwani, L. O’Callaghan, C. Olston, R. Panigrahy   +4 more
openaire   +1 more source

Computing Constrained Shortest-Paths at Scale

Operations Research, 2022
Motivated 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, Siddhartha Banerjee, Samitha Samaranayake   +2 more
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.
Martin, D. F., Estrin, G.
openaire   +1 more source

SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS

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 ...
Chen, Jindong, Han, Yijie
openaire   +1 more source

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