Results 31 to 40 of about 5,507,173 (401)

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
John R. Gilbertson   +15 more
openaire   +2 more sources

A path to computational efficiency through membrane computing [PDF]

open access: yesTheoretical 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

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

Research on dynamic window algorithm of mine mobile robot based on membrane computing and particle swarm optimizatio

open access: yesGong-kuang zidonghua, 2020
In view of problems such as unreasonable path planning, slow planning speed and poor real -time performance when mine mobile robots use traditional dynamic window algorithm to plan path in complex environment, a dynamic window algorithm of mine mobile ...
LAN Shihao   +3 more
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   +2 more sources

Method for reducing cloud workflow completion time under the task interruption

open access: yes网络与信息安全学报, 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

Computing directed Steiner path covers [PDF]

open access: yesJournal 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

The Path to Scalable Distributed Quantum Computing [PDF]

open access: yesComputer, 2016
Researchers are fabricating quantum processors powerful enough to execute small instances of quantum algorithms. Scalability concerns are motivating distributed-memory multicomputer architectures, and experimental efforts have demonstrated some of the ...
R. V. Meter, S. Devitt
semanticscholar   +1 more source

A shapley value approach to pricing climate risks [PDF]

open access: yes, 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

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 ...
Johanna N. Y. Franklin, Daniel Turetsky
openaire   +3 more sources

Home - About - Disclaimer - Privacy