Suchergebnisse - path computation algorithm

  1. 1
  2. 2

    Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling von Han, Xiaokang, Yan, Wenzhou, Lu, Mei

    ISSN: 1076-2787, 1099-0526
    Veröffentlicht: Hoboken Hindawi 2021
    Verö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. 3

    Efficient Algorithms for Temporal Path Computation von Huanhuan Wu, Cheng, James, Yiping Ke, Silu Huang, Yuzhen Huang, Hejun Wu

    ISSN: 1041-4347, 1558-2191
    Veröffentlicht: New York IEEE 01.11.2016
    Verö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. 4

    A survey on multi-constrained optimal path computation: Exact and approximate algorithms von Garroppo, Rosario G., Giordano, Stefano, Tavanti, Luca

    ISSN: 1389-1286, 1872-7069
    Veröffentlicht: Kidlington Elsevier B.V 03.12.2010
    Verö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. 5

    Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation von Martin, Sebastien, Bauguion, Pierre, Magnouche, Youcef, Leguay, Jérémie

    ISSN: 0028-3045, 1097-0037
    Veröffentlicht: Hoboken, USA John Wiley & Sons, Inc 01.06.2025
    Verö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. 6

    A dynamic path-computation algorithm for a GMPLS-enabled multi-layer network von Bukva, A., Casellas, R., Martinez, R., Munoz, R.

    ISSN: 1943-0620, 1943-0639
    Veröffentlicht: Piscataway IEEE 01.06.2012
    Verö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. 7

    A Hybrid End-to-End QoS Path Computation Algorithm for PCE-Based Multi-Domain Networks von Frikha, Ahmed, Lahoud, Samer, Cousin, Bernard

    ISSN: 1064-7570, 1573-7705
    Veröffentlicht: Boston Springer US 01.10.2014
    Verö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. 8

    Path Computation Algorithms for Dynamic Service Provisioning With Protection and Inverse Multiplexing in SDH/SONET Networks von Ramachandran, Madanagopal, Usha Rani, N, Gonsalves, Timothy A

    ISSN: 1063-6692, 1558-2566
    Veröffentlicht: New York IEEE 01.10.2010
    Verö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. 9

    A Particle Swarm Optimization and Variable Neighborhood Search based multipopulation algorithm for Inter-Domain Path Computation problem von Anh, Do Tuan, Binh, Huynh Thi Thanh, Thai, Nguyen Duc, Thanh, Pham Dinh

    ISSN: 1568-4946, 1872-9681
    Veröffentlicht: Elsevier B.V 01.03.2023
    Verö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. 10

    A Case Study on Numerical Analysis of a Path Computation Algorithm von Boussu, Grégoire, Kosmatov, Nikolai, Védrine, Franck

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 21.11.2024
    Verö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. 11

    An adaptive amoeba algorithm for shortest path tree computation in dynamic graphs von Zhang, Xiaoge, Chan, Felix T.S., Yang, Hai, Deng, Yong

    ISSN: 0020-0255, 1872-6291
    Veröffentlicht: Elsevier Inc 01.09.2017
    Verö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. 12

    A Cooperative Evolutionary Computation Algorithm for Dynamic Multiobjective Multi-AUV Path Planning von Liu, Xiao-Fang, Fang, Yongchun, Zhan, Zhi-Hui, Jiang, Yun-Liang, Zhang, Jun

    ISSN: 1551-3203, 1941-0050
    Veröffentlicht: Piscataway IEEE 01.01.2024
    Verö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. 13
  14. 14

    A new robot navigation algorithm for dynamic unknown environments based on dynamic path re-computation and an improved scout ant algorithm von Zhu, Qingbao, Hu, Jun, Cai, Wenbin, Henschen, Larry

    ISSN: 1568-4946, 1872-9681
    Veröffentlicht: Elsevier B.V 01.12.2011
    Verö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. 15
  16. 16

    A New Path Computation Algorithm and Its Implementation in NS2 von Adami, D., Callegari, D.C., Giordano, S., Pagano, M.

    ISBN: 9781424403530, 1424403537
    ISSN: 1550-3607
    Veröffentlicht: IEEE 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. 17

    Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet von Sobrinho, J.L.

    ISSN: 1063-6692, 1558-2566
    Veröffentlicht: New York IEEE 01.08.2002
    Verö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. 18

    A Ray-Tracing Algorithm Based on the Computation of (Exact) Ray Paths With Bidirectional Ray-Tracing von Taygur, Mehmet Mert, Eibert, Thomas F.

    ISSN: 0018-926X, 1558-2221
    Veröffentlicht: New York IEEE 01.08.2020
    Verö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. 19

    A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation von Misra, Jayadev

    ISSN: 0020-0190, 1872-6119
    Veröffentlicht: Amsterdam Elsevier B.V 28.02.2001
    Verö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. 20

    A hierarchical Path Computation Element (PCE)-based k-random-paths routing algorithm in multi-domain WDM networks von Shang, Shengfeng, Hua, Nan, Wang, Lei, Lu, Rui, Zheng, Xiaoping, Zhang, Hanyi

    ISSN: 1573-4277, 1872-9770
    Veröffentlicht: Elsevier B.V 01.12.2011
    Verö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