Results 41 to 50 of about 118,666 (308)
Path Integration on a Quantum Computer
Quantum Information Processing, 2002 24 pages; Revision of 9/2/02 includes a query lower bound and the upper bound of $4.22 \e^{-1}$ to compute an $\e$-approximation to a path ...
Joseph F. Traub, Henryk Wozniakowski
openaire +2 more sources
A path to computational efficiency through membrane computing [PDF]
Theoretical Computer Science, 2019 The search for new mechanisms and tools allowing us to tackle the famousPversusNPproblem from new perspectives is an important task, due to the relevance of that problem.The concept of efficiency of computing models is associated with the ability to solveintractable (in a classical sense) problems in polynomial time.
David Orellana-Martín +3 more
openaire +3 more sources
Journal of Cloud Computing: Advances, Systems and Applications, 2022 In recent years, with the development of Unmanned Aerial Vehicle (UAV) and Cloud Internet-of-Things (Cloud IoT) technology, data collection using UAVs has become a new technology hotspot for many Cloud IoT applications.
Yiguang Gong +3 more
doaj +1 more source
On the identity type as the type of computational paths [PDF]
Logic Journal of the IGPL, 2017 We introduce a new way of formalizing the intensional identity type based on the fact that a entity known as computational paths can be interpreted as terms of the identity type. Our approach enjoys the fact that our elimination rule is easy to understand and use.
Arthur F. Ramos +2 more
openaire +2 more sources
, 2023 Cloud computing is a rapidly evolving field with a wide range of applications, including data storage, processing, and analysis. Clustering schemes, cloud agent-based data schemes, and efficient path planning techniques are all important aspects of cloud
Lalit Kumar, et al.
core +1 more source
Towards knowledge-enriched path computation [PDF]
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014 Accepted as a short paper at ACM SIGSPATIAL GIS ...
Georgios Skoumas +6 more
openaire +2 more sources
Robot Static Path Planning Method Based on Deterministic Annealing
Machines, 2022 Heuristic calculation is an essential method to solve optimisation problems. However, its vast computing requirements limit its real-time and online applications, especially in embedded systems with limited computing resources, such as mobile robots ...
Jinyu Dai +5 more
doaj +1 more source
Computing homotopic shortest paths efficiently [PDF]
Computational Geometry, 2002 12 pages, 11 ...
Alon Efrat +2 more
openaire +2 more sources
Path-sensitive sparse analysis without path conditions
, 2021 Sparse program analysis is fast as it propagates data flow facts via data dependence, skipping unnecessary control flows. However, when path-sensitively checking millions of lines of code, it is still prohibitively expensive because a huge number of path
Rongxin Wu +7 more
core +1 more source
On Computing the Path Number of a Graph
Electronic Notes in Theoretical Computer Science, 2019 Abstract Gallai (1966) conjectured that the edge set of every graph G on n vertices can be covered by at most ⌈n/2⌉ edge-disjoint paths. Such a covering by edge-disjoint paths is called a path decomposition, and the size of a path decomposition with a minimum number of elements is called the path number of G. Peroche (1984) proved that the problem of
Fábio Botler +2 more
openaire +1 more source