Results 341 to 350 of about 5,507,173 (401)
Some of the next articles are maybe not open access.
IEEE Transactions on Circuits and Systems - II - Express Briefs, 2022
Path planning and formation control are both challenging and critical issues in robotics, which involve computing an optimal path from the initial position to target while keeping the desired formation.
Zhenhua Pan +4 more
semanticscholar +1 more source
Path planning and formation control are both challenging and critical issues in robotics, which involve computing an optimal path from the initial position to target while keeping the desired formation.
Zhenhua Pan +4 more
semanticscholar +1 more source
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
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
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
Liadan O'Callaghan +4 more
openaire +2 more sources
Shortest Path Computing Using Sketch Structure
, 2015Nowadays various application domains is dramatically increasing, the number of nodes may reach the scale of hundreds of millions or even more. Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be ...
K. Ramteke +3 more
semanticscholar +1 more source
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 ...
Efentakis A., Theodorakis D., Pfoser D.
openaire +2 more sources
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
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 +2 more sources
Completion Time and Energy Optimization in the UAV-Enabled Mobile-Edge Computing System
IEEE Internet of Things Journal, 2020Completion time and energy consumption of the unmanned aerial vehicle (UAV) are two important design aspects in UAV-enabled applications. In this article, we consider a UAV-enabled mobile-edge computing (MEC) system for Internet-of-Things (IoT ...
Cheng Zhan +4 more
semanticscholar +1 more source