Results 321 to 330 of about 5,064,874 (383)
Some of the next articles are maybe not open access.
Joint Optimization of Path Planning and Resource Allocation in Mobile Edge Computing
IEEE Transactions on Mobile Computing, 2020With the rapid development of mobile applications, mobile edge computing (MEC), which provides various cloud resources (e.g., computation and storage resources) closer to mobile and IoT devices for computation offloading, has been broadly studied in both
Yu Liu, Yong Li, Yong Niu, Depeng Jin
semanticscholar +1 more source
Shortest Path Computing in Relational DBMSs
IEEE Transactions on Knowledge and Data Engineering, 2014This paper takes the shortest path discovery to study efficient relational approaches to graph search queries. We first abstract three enhanced relational operators, based on which we introduce an FEM framework to bridge the gap between relational ...
Jun Gao +3 more
semanticscholar +1 more source
Path Selection for Seamless Service Migration in Vehicular Edge Computing
IEEE Internet of Things Journal, 2020Mobile-edge computing provisions computing and storage resources by deploying edge servers (ESs) at the edge of the network to support ultralow delay and high bandwidth services.
Jinliang Xu +4 more
semanticscholar +1 more source
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
T. Feder +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
Context-Aware Routing in Fog Computing Systems
IEEE Transactions on Cloud Computing, 2023Fog computing enables the execution of IoT applications on compute nodes which reside both in the cloud and at the edge of the network. To achieve this, most fog computing systems route the IoT data on a path which starts at the data source, and goes ...
Vasileios Karagiannis +3 more
semanticscholar +1 more source
TransCT: Dual-Path Transformer for Low Dose Computed Tomography
International Conference on Medical Image Computing and Computer-Assisted Intervention, 2021Low dose computed tomography (LDCT) has attracted more and more attention in routine clinical diagnosis assessment, therapy planning, etc., which can reduce the dose of X-ray radiation to patients. However, the noise caused by low X-ray exposure degrades
Zhicheng Zhang +4 more
semanticscholar +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.
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, 1996We 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)
2015The 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