Suchergebnisse - path computation algorithm
-
1
A Case Study on Numerical Analysis of a Path Computation Algorithm
ISSN: 2075-2180, 2075-2180Veröffentlicht: 21.11.2024Veröffentlicht in Electronic proceedings in theoretical computer science (21.11.2024)Volltext
Journal Article -
2
Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling
ISSN: 1076-2787, 1099-0526Veröffentlicht: Hoboken Hindawi 2021Veröffentlicht in Complexity (New York, N.Y.) (2021)“… Therefore, an algorithm with a faster convergence is needed to improve the efficiency of the critical path computation …”
Volltext
Journal Article -
3
Efficient Algorithms for Temporal Path Computation
ISSN: 1041-4347, 1558-2191Veröffentlicht: New York IEEE 01.11.2016Veröffentlicht in IEEE transactions on knowledge and data engineering (01.11.2016)“… We propose efficient algorithms to compute minimum temporal paths and verified their efficiency using large real-world temporal graphs …”
Volltext
Journal Article -
4
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
ISSN: 1389-1286, 1872-7069Veröffentlicht: Kidlington Elsevier B.V 03.12.2010Veröffentlicht in Computer networks (Amsterdam, Netherlands : 1999) (03.12.2010)“… In the present work, we draw the state of the art of exact and approximate MCOP computation algorithms, with particular attention to the networking …”
Volltext
Journal Article -
5
Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation
ISSN: 0028-3045, 1097-0037Veröffentlicht: Hoboken, USA John Wiley & Sons, Inc 01.06.2025Veröffentlicht in Networks (01.06.2025)“… Usually, efficient algorithms to handle a restricted subset of these additional constraints already exist or can be easily derived, but combining them together is difficult …”
Volltext
Journal Article -
6
A dynamic path-computation algorithm for a GMPLS-enabled multi-layer network
ISSN: 1943-0620, 1943-0639Veröffentlicht: Piscataway IEEE 01.06.2012Veröffentlicht in Journal of optical communications and networking (01.06.2012)“… In this paper, we propose a path-computation algorithm for a dynamic virtual network topology (VNT) configuration …”
Volltext
Journal Article -
7
A Hybrid End-to-End QoS Path Computation Algorithm for PCE-Based Multi-Domain Networks
ISSN: 1064-7570, 1573-7705Veröffentlicht: Boston Springer US 01.10.2014Veröffentlicht in Journal of network and systems management (01.10.2014)“… In this paper, we propose a novel hybrid end-to-end QoS path computation algorithm, named HID-MCP, for PCE-based networks …”
Volltext
Journal Article -
8
Path Computation Algorithms for Dynamic Service Provisioning With Protection and Inverse Multiplexing in SDH/SONET Networks
ISSN: 1063-6692, 1558-2566Veröffentlicht: New York IEEE 01.10.2010Veröffentlicht in IEEE/ACM transactions on networking (01.10.2010)“… Dynamic service provisioning requires the use of online algorithms that automatically compute the path to be taken to satisfy the given service request …”
Volltext
Journal Article -
9
A Particle Swarm Optimization and Variable Neighborhood Search based multipopulation algorithm for Inter-Domain Path Computation problem
ISSN: 1568-4946, 1872-9681Veröffentlicht: Elsevier B.V 01.03.2023Veröffentlicht in Applied soft computing (01.03.2023)“… This paper focuses on the Inter-Domain Path Computation under Node-defined Domain Uniqueness Constraint (IDPC-NDU …”
Volltext
Journal Article -
10
A Case Study on Numerical Analysis of a Path Computation Algorithm
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 21.11.2024Veröffentlicht in arXiv.org (21.11.2024)“… implementation of the fast marching algorithm, a popular path computation algorithm frequently used for trajectory computation …”
Volltext
Paper -
11
An adaptive amoeba algorithm for shortest path tree computation in dynamic graphs
ISSN: 0020-0255, 1872-6291Veröffentlicht: Elsevier Inc 01.09.2017Veröffentlicht in Information sciences (01.09.2017)“… In today’s Internet, the shortest path tree (SPT) construction is an important issue in data exchange …”
Volltext
Journal Article -
12
A Cooperative Evolutionary Computation Algorithm for Dynamic Multiobjective Multi-AUV Path Planning
ISSN: 1551-3203, 1941-0050Veröffentlicht: Piscataway IEEE 01.01.2024Veröffentlicht in IEEE transactions on industrial informatics (01.01.2024)“… Thus, this paper models the problem as a dynamic multiobjective optimization problem and proposes a cooperative evolutionary computation algorithm to provide diverse and high-quality solutions for decision makers …”
Volltext
Journal Article -
13
Node-depth based Genetic Algorithm to solve Inter-Domain path computation problem
ISSN: 0950-7051Veröffentlicht: 25.01.2024Veröffentlicht in Knowledge-based systems (25.01.2024)Volltext
Journal Article -
14
A new robot navigation algorithm for dynamic unknown environments based on dynamic path re-computation and an improved scout ant algorithm
ISSN: 1568-4946, 1872-9681Veröffentlicht: Elsevier B.V 01.12.2011Veröffentlicht in Applied soft computing (01.12.2011)“… A difficult issue in robot navigation or path planning in an unknown environment with static or dynamic obstacles is to find a globally optimal path from the start to the target point and at the …”
Volltext
Journal Article -
15
Multifactorial Evolutionary Algorithm with Nodedepth Encoding for Inter-Domain Path Computation Under Node-Defined Domain Uniqueness Constraint
ISSN: 0950-7051Veröffentlicht: 01.11.2025Veröffentlicht in Knowledge-based systems (01.11.2025)Volltext
Journal Article -
16
A New Path Computation Algorithm and Its Implementation in NS2
ISBN: 9781424403530, 1424403537ISSN: 1550-3607Veröffentlicht: IEEE 01.06.2007Veröffentlicht in 2007 IEEE International Conference on Communications (01.06.2007)“… In this paper, we introduce a novel path computation procedure which aims at improving the performance of the well-known Wang-Crowcroft algorithm by means of some heuristics …”
Volltext
Tagungsbericht -
17
Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet
ISSN: 1063-6692, 1558-2566Veröffentlicht: New York IEEE 01.08.2002Veröffentlicht in IEEE/ACM transactions on networking (01.08.2002)“… can be computed with a generalization of E.W. Dijkstra's algorithm (see Numer. Math., vol.1, p.269-71, 1959). We define an algebra of weights which contains a binary operation, for the composition of link weights into path weights, and an order relation …”
Volltext
Journal Article -
18
A Ray-Tracing Algorithm Based on the Computation of (Exact) Ray Paths With Bidirectional Ray-Tracing
ISSN: 0018-926X, 1558-2221Veröffentlicht: New York IEEE 01.08.2020Veröffentlicht in IEEE transactions on antennas and propagation (01.08.2020)“… A novel ray-tracing algorithm to cope with the phase errors due to incorrect ray path computations in ray-launching approaches is presented …”
Volltext
Journal Article -
19
A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation
ISSN: 0020-0190, 1872-6119Veröffentlicht: Amsterdam Elsevier B.V 28.02.2001Veröffentlicht in Information processing letters (28.02.2001)“… We present a derivation of Dijkstra's shortest path algorithm [Numer. Math. 1 (1959) 83]. We view the problem as computation …”
Volltext
Journal Article -
20
A hierarchical Path Computation Element (PCE)-based k-random-paths routing algorithm in multi-domain WDM networks
ISSN: 1573-4277, 1872-9770Veröffentlicht: Elsevier B.V 01.12.2011Veröffentlicht in Optical switching and networking (01.12.2011)“… On the basis of the hierarchical Path Computation Element (PCE) architecture, the proposed algorithm introduces a k random path strategy in the parent PCE to adjust the algorithm optimization level …”
Volltext
Journal Article

