Results 21 to 30 of about 98,734 (264)

Computing with words for solving the fuzzy shortest path problem [PDF]

open access: yesتصمیم گیری و تحقیق در عملیات
Purpose: The purpose of this paper is to address decision-making challenges in shortest path problems where arc lengths are expressed using natural language rather than precise numerical values and to develop an enhanced A* algorithm for computing the ...
Jayanta Pratihar   +4 more
doaj   +1 more source

Reconfigurable Computing for Tool-Path Computation

open access: yesThe International Journal of Advanced Manufacturing Technology, 2003
Tool path generation is one of the most complex problems in Computer Aided Manufacturing. Although some efficient strategies have been developed to solve it, most of them are only useful for 3 and 5 axis standard machining. The algorithm called Virtual Digitising computes the tool path by means of a “virtually digitised” model of the surface and a ...
Jimeno-Morenilla, Antonio   +1 more
openaire   +2 more sources

Research and Design of Automated Guided Vehicle Cloud Guided Platform [PDF]

open access: yesJisuanji gongcheng, 2017
Aiming at the problems that the guidance mode of traditional Automated Guided Vehicle(AGV)has weak anti-interference,low flexibility,and high cost,this paper proposes a new cloud-based guidance mode,and designs and implements the core Cloud-based Guided ...
XING Haiyang,ZHANG Jun,WANG Nan
doaj   +1 more source

Taking the path computably traveled

open access: yesJournal of Logic and Computation, 2019
Abstract We define a real $A$ to be low for paths in Baire space (or Cantor space) if every $\varPi ^0_1$ class with an $A$-computable element has a computable element. We prove that lowness for paths in Baire space and lowness for paths in Cantor space are equivalent and, furthermore, that these notions are also equivalent to lowness ...
Johanna N. Y. Franklin, Dan Turetsky
openaire   +2 more sources

ttcrpy: A Python package for traveltime computation and raytracing

open access: yesSoftwareX, 2021
ttcrpy is a package for computing traveltimes and raytracing of seismic and electromagnetic waves for geophysical applications, e.g. ray-based seismic/GPR tomography, microseismic event location (joint hypocenter-velocity inversion), and migration.
Bernard Giroux
doaj   +1 more source

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

Computational Pathology: A Path Ahead [PDF]

open access: yesArchives of Pathology & Laboratory Medicine, 2015
Context We define the scope and needs within the new discipline of computational pathology, a discipline critical to the future of both the practice of pathology and, more broadly, medical practice in general. Objective To define the ...
David N, Louis   +15 more
openaire   +2 more sources

Computing geodesic paths on manifolds [PDF]

open access: yesProceedings 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 ...
Kimmel, R., Sethian, J. A.
openaire   +2 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

Path Integration on a Quantum Computer

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

Home - About - Disclaimer - Privacy