Suchergebnisse - "complexity algorithms"

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    Weitere Verfasser: Schmid, Stefan Schnepf, Nicolas Srba, Jiri et al.

    Quelle: Lecture Notes in Computer Science ISBN: 9783030720155
    Tools and Algorithms for the Construction and Analysis of Systems
    Schmid, S, Schnepf, N & Srba, J 2021, Resilient Capacity-Aware Routing. in J F Groote & K Guldstrand Larsen (eds), Tools and Algorithms for the Construction and Analysis of Systems : 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I. vol. 1, Springer, Lecture Notes in Computer Science, vol. 12651, pp. 411-429, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'21), 27/03/2021. https://doi.org/10.1007/978-3-030-72016-2_22
    Schmid, S, Schnepf, N & Srba, J 2021, Resilient Capacity-Aware Routing . in J F Groote & K Guldstrand Larsen (eds), Tools and Algorithms for the Construction and Analysis of Systems : 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I . vol. 1, Springer, Lecture Notes in Computer Science, vol. 12651, pp. 411-429, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'21), 27/03/2021 . https://doi.org/10.1007/978-3-030-72016-2_22

    Dateibeschreibung: application/pdf

  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

    Autoren: L.A.Pomortsev

    Quelle: Global Journal of Computer Science and Technology; Vol. 19 No. G4 (2019): GJCST-G Interdisciplinary: Volume 19 Issue G4; 1-15 ; 0975-4172 ; 0975-4350

    Dateibeschreibung: application/pdf; application/zip; text/xml; text/html; application/epub+zip; text/plain; text/x-tex

  17. 17

    Quelle: https://theses.hal.science/tel-04538513 ; Complexité [cs.CC]. Université Paris-Saclay, 2024. Français. ⟨NNT : 2024UPASL002⟩.

    Relation: NNT: 2024UPASL002

  18. 18
  19. 19
  20. 20