Results 31 to 40 of about 5,433,526 (396)
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
The Path to Scalable Distributed Quantum Computing [PDF]
Computer, 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
Journal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022 Abstract Purpose A set of treatment planning strategies were designed and retrospectively implemented for locally advanced, non‐small cell lung cancer (NSCLC) patients in order to minimize cardiac dose without compromising target coverage goals. Methods Retrospective analysis was performed for 20 NSCLC patients prescribed to 60–66 Gy that received a ...
Joshua P. Kim +5 more
wiley +1 more source
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
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
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
Journal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022 Abstract Purpose Treatment planning for head‐and‐neck (H&N) cancer, in particular oropharynx, nasopharynx, and paranasal sinus cases, at our center requires noncoplanar proton beams due to the complexity of the anatomy and target location. Targeting accuracy for all beams is carefully evaluated by using image guidance before delivering proton beam ...
Nrusingh C. Biswal +5 more
wiley +1 more source
Treatment planning with a 2.5 MV photon beam for radiation therapy
Journal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022 Abstract Purpose The shallow depth of maximum dose and higher dose fall‐off gradient of a 2.5 MV beam along the central axis that is available for imaging on linear accelerators is investigated for treatment of shallow tumors and sparing the organs at risk (OARs) beyond it.
Navid Khaledi +5 more
wiley +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
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