Results 31 to 40 of about 1,024,245 (290)

Grid-Based coverage path planning with NFZ avoidance for UAV using parallel self-adaptive ant colony optimization algorithm in cloud IoT

open access: yesJournal 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

East-West paths to unconventional computing [PDF]

open access: yesProgress in Biophysics and Molecular Biology, 2017
Unconventional computing is about breaking boundaries in thinking, acting and computing. Typical topics of this non-typical field include, but are not limited to physics of computation, non-classical logics, new complexity measures, novel hardware, mechanical, chemical and quantum computing.
Adamatzky A   +19 more
openaire   +4 more sources

Robot Static Path Planning Method Based on Deterministic Annealing

open access: yesMachines, 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

The minimum energy expenditure shortest path method [PDF]

open access: yes, 2014
This article discusses the addition of an energy parameter to the shortest path execution process; namely, the energy expenditure by a character during execution of the path.
Choset H.   +14 more
core   +1 more source

Explicit Computational Paths

open access: yes, 2016
The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are proofs that $a$ and $b$ are equal elements of type $A$.
Ramos, Arthur Freitas   +2 more
openaire   +2 more sources

Computing Tutte Paths

open access: yes, 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.
openaire   +5 more sources

Centrifugal Compressor Polytropic Performance—Improved Rapid Calculation Results—Cubic Polynomial Methods

open access: yesInternational Journal of Turbomachinery, Propulsion and Power, 2021
This paper presents a new improved approach to calculation of polytropic performance of centrifugal compressors. This rapid solution technique is based upon a constant efficiency, temperature-entropy polytropic path represented by cubic polynomials.
Matt Taher, Fred Evans
doaj   +1 more source

Energy estimators for random series path-integral methods [PDF]

open access: yes, 2003
We perform a thorough analysis on the choice of estimators for random series path integral methods. In particular, we show that both the thermodynamic (T-method) and the direct (H-method) energy estimators have finite variances and are straightforward to
Doll, J. D.   +3 more
core   +4 more sources

Computing a rectilinear shortest path amid splinegons in plane

open access: yes, 2017
We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define
DP Dobkin   +16 more
core   +1 more source

Home - About - Disclaimer - Privacy