Results 1 to 10 of about 5,385,809 (394)
Computing Homotopic Shortest Paths Efficiently [PDF]
arXiv, 2002 This paper addresses the problem of finding shortest paths homotopic to a given disjoint set of paths that wind amongst point obstacles in the plane. We present a faster algorithm than previously known.
Alon Efrat, Stephen Kobourov, Anna Lubiw
arxiv +8 more sources
arXiv, 2017 Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and these overlaps hinder to bound the running time to a polynomial.
Schmid, A., Schmidt, J.
arxiv +5 more sources
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
Faster Computation of Path-Width [PDF]
arXiv, 2016 Tree-width and path-width are widely successful concepts. Many NP-hard problems have efficient solutions when restricted to graphs of bounded tree-width. Many efficient algorithms are based on a tree decomposition. Sometimes the more restricted path decomposition is required.
Martin Fürer, Martin Fürer
arxiv +5 more sources
IEEE Internet of Things Journal, 2022 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 ...
Andrey V. Savkin, Chao Huang, Wei Ni
openalex +3 more sources
The computability path ordering: the end of a quest [PDF]
, 2008 Dans CSL'08 (2008)
Frédéric Blanqui +2 more
openalex +7 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
Theory of quantum path computing with Fourier optics and future applications for quantum supremacy, neural networks and nonlinear Schrödinger equations. [PDF]
Sci Rep, 2020 Gulbahar B.
europepmc +3 more sources
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
Designing Network Design Strategies Through Gradient Path Analysis [PDF]
Journal of information science and engineering, 2022 Designing a high-efficiency and high-quality expressive network architecture has always been the most important research topic in the field of deep learning.
Chien-Yao Wang, Hongpeng Liao, I-Hau Yeh
semanticscholar +1 more source