Results 11 to 20 of about 98,734 (264)
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 +1 more source
Applied Sciences, 2021 Finding an optimal/quasi-optimal path for Unmanned Aerial Vehicles (UAVs) utilizing full map information yields time performance degradation in large and complex three-dimensional (3D) urban environments populated by various obstacles. A major portion of
Abdul Majeed, Seong Oun Hwang
doaj +1 more source
Determining Effective Factors in Cloud Computing Acceptance Using Rogers’ Diffusion of Innovation Model and Davis’ Technology Adoption Model (A Case of Financial Institution) [PDF]
Journal of Electrical and Computer Engineering Innovations, 2022 Background and Objectives: Determining effective factors in cloud computing adoption on employees of Noor credit institution in South Khorasan province, Iran, is the purpose of the present study.
H. KardanMoghaddam, A. Rajaei, F. Jafari
doaj +1 more source
IEEE Access, 2020 In modern transportation, traffic congestion has become an urgent problem in large and medium-sized cities. In smart transportation systems, it is an effective solution to design load balancing path planning algorithms that can dynamically adapt to ...
Ning Sun +4 more
doaj +1 more source
Gong-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
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
CoRR, 2017 Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and these overlaps hinder to bound the running time to a polynomial.
Andreas Schmid 0003, Jens M. Schmidt
openaire +5 more sources
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
Computational paths - a weak groupoid
Journal of Logic and Computation, 2023 Abstract On the basis of a labelled deduction system (LND$_{ED-}$TRS), we demonstrate how to formalize the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type. This has allowed us to carry out a formal counterpart to equality between paths which is dealt with in homotopy theory, but ...
Tiago M. L. de Veras +3 more
openaire +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 $$
Frank Gurski +4 more
openaire +3 more sources