Results 1 to 10 of about 5,064,874 (383)
IEEE Access, 2020 During mobile edge computing, due to the movement of nodes and the exhaustion of node energy, link failure occurs thus reducing the network lifetime in the mobile ad-hoc network. When the route fails, because the single-path protocols need to restart the
De-Gan Zhang +6 more
doaj +2 more sources
Computing geodesic paths on manifolds [PDF]
Proceedings of the National Academy of Sciences, 1998 The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O ( M log M ) steps, where M is the total number of grid points.
Ron Kimmel, James A. Sethian
openalex +4 more sources
Self-Rectifying Memristors for Beyond-CMOS Computing: Mechanisms, Materials, and Integration Prospects [PDF]
Nano-Micro LettersHighlights SRMs integrate intrinsic diode-like rectification, enabling sneak path suppression in crossbar arrays without external selectors, simplifying design, and enhancing energy efficiency for high-density in-memory computing.
Guobin Zhang +10 more
doaj +2 more sources
Memristive Crossbar Arrays for Storage and Computing Applications
Advanced Intelligent Systems, 2021 The emergence of memristors with potential applications in data storage and artificial intelligence has attracted wide attentions. Memristors are assembled in crossbar arrays with data bits encoded by the resistance of individual cells.
Huihan Li +10 more
doaj +2 more sources
Multi-UAV Mobile Edge Computing and Path Planning Platform Based on Reinforcement Learning [PDF]
IEEE Transactions on Emerging Topics in Computational Intelligence, 2021 Unmanned Aerial vehicles (UAVs) are widely used as network processors in mobile networks, but more recently, UAVs have been used in Mobile Edge Computing as mobile servers.
Huan Chang +3 more
semanticscholar +1 more source
Computing directed Steiner path covers [PDF]
Journal of Combinatorial Optimization, 2021 AbstractIn this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph $$G=(V,E)$$ G = ( V , E ) and a set $$
Gurski, Frank +4 more
openaire +3 more sources
Path planning for mobile robots using Morphological Dilation Voronoi Diagram Roadmap algorithm
Scientific African, 2021 This paper presents Morphological Dilation Voronoi Diagram Roadmap (MVDRM) algorithm to address unsafe path computation accompanied by high time and space computation complexity problems of roadmap path planning methods in complex environments for mobile
Ben Beklisi Kwame Ayawli +4 more
doaj +1 more source
“Computing” and “Information”: Two Paths in “Information Turn”
Proceedings, 2021 The “information turn” has gradually become a new direction in philosophy to replace the “linguistic turn”, with “computing” and “information” as the main paths.
Wei He
doaj +1 more source
IEEE Internet of Things Journal, 2023 This article addresses a joint path planning and communication scheduling problem for a team of unmanned aerial vehicles (UAVs) equipped with central processing units and performing computing tasks for Internet of Things (IoT) devices located on uneven ...
A. Savkin, Chao Huang, Wei Ni
semanticscholar +1 more source
Path Planning for UAV-Mounted Mobile Edge Computing With Deep Reinforcement Learning [PDF]
IEEE Transactions on Vehicular Technology, 2020 In this letter, we study an unmanned aerial vehicle (UAV)-mounted mobile edge computing network, where the UAV executes computational tasks offloaded from mobile terminal users (TUs) and the motion of each TU follows a Gauss-Markov random model.
Qian Liu +5 more
semanticscholar +1 more source