Results 21 to 30 of about 973,180 (337)
A path to computational efficiency through membrane computing [PDF]
Theoretical Computer Science, 2019 The search for new mechanisms and tools allowing us to tackle the famousPversusNPproblem from new perspectives is an important task, due to the relevance of that problem.The concept of efficiency of computing models is associated with the ability to solveintractable (in a classical sense) problems in polynomial time.
David Orellana-Martín +3 more
openaire +3 more sources
Method for reducing cloud workflow completion time under the task interruption
网络与信息安全学报, 2020 As more and more large-scale scientific workflows are delivered to clouds, the business model of workflow-as-a-service is emerging. But there are many kinds of threats in the cloud environment, which can interrupt the task execution and extend the ...
Yawen WANG, Yunfei GUO, Wenyan LIU, Shumin HUO
doaj +1 more source
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
A shapley value approach to pricing climate risks [PDF]
, 2011 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
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.
ADAMI, DAVIDE +3 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
Faster Computation of Path-Width [PDF]
, 2016 14 ...
Martin Fürer, Martin Fürer
openaire +3 more sources
Shortest Paths Avoiding Forbidden Subpaths [PDF]
, 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
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, Daniel Turetsky
openaire +3 more sources
Computing directed Steiner path covers [PDF]
Journal of Combinatorial Optimization, 2021 AbstractIn this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph $$G=(V,E)$$ G = ( V , E ) and a set $$
Carolin Rehs +4 more
openaire +3 more sources