Results 1 to 10 of about 5,558,875 (400)
Computing Homotopic Shortest Paths Efficiently [PDF]
Computational Geometry, 2002 12 pages, 11 ...
Alon Efrat, Stephen Kobourov, Anna Lubiw
openalex +6 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, Andreas, Schmidt, Jens M.
arxiv +6 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
The computability path ordering: the end of a quest [PDF]
, 2008 Dans CSL'08 (2008)
Frédéric Blanqui +2 more
openalex +6 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
“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
The computability path ordering [PDF]
Logical Methods in Computer Science, 2015 This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by lifting a precedence on function symbols.
Frédéric Blanqui +3 more
openaire +9 more sources
Partitioning multi-layer edge network for neural network collaborative computing
EURASIP Journal on Wireless Communications and Networking, 2023 There is a trend to deploy neural network on edge devices in recent years. While the mainstream of research often concerns with single edge device processing and edge-cloud two-layer neural network collaborative computing, in this paper, we propose ...
Qiang Li +4 more
doaj +1 more source
Robotics, 2022 In response to the issue of virus contamination in the cold-chain warehouse or hospital environment under the influence of the COVID-19, we propose the design work of a disinfection robot based on the UVC radiation mechanism using the low-computational ...
Sen Wang +6 more
doaj +1 more source
A path planning approach for mobile robots using short and safe Q-learning
PLoS ONE, 2022 Path planning is a major challenging problem for mobile robots, as the robot is required to reach the target position from the starting position while simultaneously avoiding conflicts with obstacles. This paper refers to a novel method as short and safe
He Du +5 more
doaj +2 more sources