Results 111 to 120 of about 5,507,173 (401)
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
Routing Optimization of Mobile Network System [PDF]
Engineering and Technology Journal, 2009 To send the packets from source to destination node on optimum route in mobile network,the router must find the path with minimum cost. If intermediate node has fialed, the routingtable will be updated and the path should be changed depending on this ...
Thamir Rashed, Emad Shehab, Dalia Kamal
doaj +1 more source
Rerouting Planar Curves and Disjoint Paths [PDF]
arXiv, 2022 In this paper, we consider a transformation of $k$ disjoint paths in a graph. For a graph and a pair of $k$ disjoint paths $\mathcal{P}$ and $\mathcal{Q}$ connecting the same set of terminal pairs, we aim to determine whether $\mathcal{P}$ can be transformed to $\mathcal{Q}$ by repeatedly replacing one path with another path so that the intermediates ...
arxiv
One-way quantum computing in superconducting circuits
, 2018 We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum resource, while ...
Albarrán-Arriagada, F. +6 more
core +1 more source
Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]
, 2005 We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries.
Köhler, Ekkehard +2 more
openaire +2 more sources
YAFS: A Simulator for IoT Scenarios in Fog Computing [PDF]
IEEE Access, 2019 Fog computing is a paradigm that extends the cloud to intermediate network devices with computational and storage capacities. This allows the execution of applications closer to edge devices and end-users by allocating services in those intermediate ...
Isaac Lera, Carlos Guerrero, C. Juiz
semanticscholar +1 more source
CAD Adjacency Computation Using Validated Numerics
, 2017 We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g.
Strzebonski, Adam
core +1 more source
Constrained Shortest Path Computation
, 2005 This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an a-autonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a.
TERROVITIS, Manolis +3 more
openaire +4 more sources
Electric Vehicle Charging Warning and Path Planning Method Based on Spark
IEEE Access, 2020 Electric vehicles (EVs) are increasing popular as clean transportation. However electric vehicle (EV) users often encounter a shortage of electricity in the driving process. Especially when vehicle charging path planning system request reaches peak hour,
Dong Ding +5 more
doaj +1 more source
Application of New Technology of Intelligent Robot Plant Protection in Ecological Agriculture
Journal of Food Quality, 2022 Crop diseases, pest infestations, water shortages, weed infestations, and other issues affect the agriculture sector. Due to existing agricultural techniques, these issues result in significant crop loss, economic loss, and severe environmental hazards ...
Zhe An +6 more
doaj +1 more source