Results 31 to 40 of about 5,064,874 (383)

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

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 scope and needs
David N, Louis   +15 more
openaire   +2 more sources

Quantum technology to expand soft computing

open access: yesSystems and Soft Computing, 2022
Soft computing was founded to unify and advance computing methods beyond the limits of binary variables, Boolean logic and Turing machines. David Deutsch invented a way to use massive quantum parallelism to massively improve the power of Turing machines ...
Paul J. Werbos
doaj   +1 more source

Path computation algorithms in NS2 [PDF]

open access: yesProceedings of the First International ICST Conference on Simulation Tools and Techniques for Communications Networks and Systems, 2008
Originally designed to improve the efficiency of packets forwarding, MPLS provides support for Traffic Engineering and network resilience. Constrained-based path computation is a key building block for Traffic Engineering in MPLS networks, since it allows to set-up LSPs along paths that satisfy QoS constraints.
ADAMI, DAVIDE   +3 more
openaire   +1 more source

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

Shortest Paths Avoiding Forbidden Subpaths [PDF]

open access: yes, 2009
In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P.
Ahmed, Mustaq, Lubiw, Anna
core   +6 more sources

A Survey on the Convergence of Edge Computing and AI for UAVs: Opportunities and Challenges

open access: yesIEEE Internet of Things Journal, 2022
The latest 5G mobile networks have enabled many exciting Internet of Things (IoT) applications that employ unmanned aerial vehicles (UAVs/drones).
P. McEnroe   +2 more
semanticscholar   +1 more source

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

Demonstration of quantum volume 64 on a superconducting quantum computing system [PDF]

open access: yesQuantum Science and Technology, 2020
We improve the quality of quantum circuits on superconducting quantum computing systems, as measured by the quantum volume (QV), with a combination of dynamical decoupling, compiler optimizations, shorter two-qubit gates, and excited state promoted ...
P. Jurcevic   +30 more
semanticscholar   +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 ...
Franklin, Johanna N. Y., Turetsky, Dan
openaire   +2 more sources

Home - About - Disclaimer - Privacy