Results 21 to 30 of about 1,003,319 (338)
A shapley value approach to pricing climate risks [PDF]
This paper prices the risk of climate change by calculating a lower bound for the price of a virtual insurance policy against climate risks associated with the business as usual (BAU) emissions path. In analogy with ordinary insurance pricing, this price
Cooke, Roger M
core +2 more sources
Quantum technology to expand soft computing
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
Reconfigurable Computing for Tool-Path Computation
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
Taking the path computably traveled
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
Physarum can compute shortest paths [PDF]
Physarum Polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by biologists to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foraging two food sources s0 and s1.
Bonifaci V, Mehlhorn K, Varma G
openaire +8 more sources
A neural network for shortest path computation [PDF]
This paper presents a new neural network to solve the shortest path problem for inter-network routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem.
F. Araújo, B. Ribeiro, L. Rodrigues
openaire +3 more sources
Research and Design of Automated Guided Vehicle Cloud Guided Platform [PDF]
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]
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
ttcrpy: A Python package for traveltime computation and raytracing
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
Shortest path computation with no information leakage [PDF]
Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences ...
MOURATIDIS, Kyriakos, YIU, Man Lung
openaire +3 more sources

