Results 21 to 30 of about 1,659,550 (345)
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
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
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
Faster Computation of Path-Width [PDF]
, 2016 14 ...
Martin Fürer, Martin Fürer
openaire +3 more sources
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
Advanced Engineering Materials, EarlyView., 2023 The study presents the mechanical and in situ sensing performance of digital light processing‐enabled 2D lattice nanocomposites under monotonic tensile and repeated cyclic loading, and provides guidelines for the design of architectures suitable for strain sensors and smart lightweight structures.
Omar Waqas Saadi +3 more
wiley +1 more source
Path planning for mobile robots using Morphological Dilation Voronoi Diagram Roadmap algorithm
Scientific African, 2021 This paper presents Morphological Dilation Voronoi Diagram Roadmap (MVDRM) algorithm to address unsafe path computation accompanied by high time and space computation complexity problems of roadmap path planning methods in complex environments for mobile
Ben Beklisi Kwame Ayawli +4 more
doaj
Journal of Cloud Computing: Advances, Systems and Applications, 2022 In recent years, with the development of Unmanned Aerial Vehicle (UAV) and Cloud Internet-of-Things (Cloud IoT) technology, data collection using UAVs has become a new technology hotspot for many Cloud IoT applications.
Yiguang Gong +3 more
doaj +1 more source
A simple scheme for expanding photonic cluster states for quantum information [PDF]
, 2010 We show how an entangled cluster state encoded in the polarization of single photons can be straightforwardly expanded by deterministically entangling additional qubits encoded in the path degree of freedom of the constituent photons.
A. Laing +26 more
core +3 more sources