Results 31 to 40 of about 118,666 (308)
CoRR, 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.
Andreas Schmid 0003, Jens M. Schmidt
openaire +5 more sources
Quantum technology to expand soft computing
Systems 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
, 2022 In recent years, individual learning path planning has become prevalent in online learning systems, while few studies have focused on teaching path planning for traditional classroom teaching.
Lin Zuo +3 more
core +1 more source
Research and Design of Automated Guided Vehicle Cloud Guided Platform [PDF]
Jisuanji 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
Journal 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
Future trends in optimum-path forest classification
, 2022 In the past years, we have observed an increasing number of applications that require machine learning techniques to sort out problems that are not straightforward to humans. The reasons vary from information that is not clearly visible to the human eye (
Papa, João Paulo [UNESP] +3 more
core +1 more source
Computational Pathology: A Path Ahead [PDF]
Archives 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
ttcrpy: A Python package for traveltime computation and raytracing
SoftwareX, 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
Path computation algorithms in NS2 [PDF]
Proceedings 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.
Davide Adami +3 more
openaire +1 more source
Computing geodesic paths on manifolds [PDF]
Proceedings 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 grid points.
Kimmel, R., Sethian, J. A.
openaire +2 more sources