Zobrazeno 1 - 10
of 1 812
pro vyhledávání: '"Constrained Shortest Path First"'
Publikováno v:
ResearcherID
Cognitive radio networks (CRNs) are expected to improve spectrum utilization efficiently by allowing secondary users (SUs) to opportunistically access the licensed spectrum of primary users (PUs). In CRNs, source and destination SUs may achieve infor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39d234ce167768377a660d913c4b71e6
https://doi.org/10.1109/cc.2017.8246338
https://doi.org/10.1109/cc.2017.8246338
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).
We describe a constrained shortest path first (CSPF) routing algorithm for lambda-switched optical networks with logical overlay OCh/SP rings. Speed is definitely a requirement if the algorithm is to be used for lambda-switching, but several features
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0114345dd3c088822d6eb78c88b5de14
https://doi.org/10.1109/hpsr.2001.923622
https://doi.org/10.1109/hpsr.2001.923622
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
J Res Natl Bur Stand (1977)
A number of labeling procedures for determining shortest paths in a network employ a sequence list in order to carry out the required steps systematically. This paper studies certain formal properties of such sequence lists. It is shown that the desi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ab8e6d8c3f906d1ddcbfce7e08e4fc9
https://pubmed.ncbi.nlm.nih.gov/34566048
https://pubmed.ncbi.nlm.nih.gov/34566048
Publikováno v:
Computers & Electrical Engineering. 71:1025-1039
A novel shortest path connectivity and coverage algorithm (SPCCA) for wireless sensor networks is proposed to reduce the energy consumption and to extend the network lifetime. The main procedure of SPCCA is as follows: first, each node determines whe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ce0504ba01f7d4916d84ae12c70da13
https://doi.org/10.1016/j.compeleceng.2017.10.019
https://doi.org/10.1016/j.compeleceng.2017.10.019
Publikováno v:
IEEE Transactions on Intelligent Transportation Systems. 19:1080-1090
Routing service considering uncertainty is at the core of intelligent transportation systems and has attracted increasing attention. Existing stochastic shortest path models require the exact probability distributions of travel times and usually assu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e4924fbdb9679f65df5b829b0300a51
https://doi.org/10.1109/tits.2017.2709798
https://doi.org/10.1109/tits.2017.2709798
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319973036
PRICAI (1)
PRICAI (1)
This paper presents a new path computation algorithm for the batch bandwidth constrained routing problem, aiming to reduce the end-to-end running time of a routing algorithm while maintaining the quality of the solution set. The batch bandwidth const
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46e1dd139c77344638c4e69d8f1c368b
https://doi.org/10.1007/978-3-319-97304-3_38
https://doi.org/10.1007/978-3-319-97304-3_38
Autor:
Manisha Mishra, James E Peak, Bala Kishore Nadella, David Sidoti, James A. Hansen, Krishna R. Pattipati, G.V. Avvari, Lingyi Zhang
Publikováno v:
IEEE Transactions on Systems, Man, and Cybernetics: Systems. 47:3256-3271
This paper presents a mixed-initiative tool for multiobjective planning and asset routing (TMPLAR) in dynamic and uncertain environments. TMPLAR is built upon multiobjective dynamic programming algorithms to route assets in a timely fashion, while co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23f27f0a5a1103285adcad37e8c4ff3d
https://doi.org/10.1109/tsmc.2016.2573271
https://doi.org/10.1109/tsmc.2016.2573271
Publikováno v:
Physical Communication. 25:376-385
Stochastic Shortest Path Routing (SSPR) problem has always been a critical topic in communication area, especially after a boom in the 5G wireless communication emerges. In this paper, we consider the SSPR problem in a network, where the context is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::732590e698fe797d90d192bd1f5095f4
https://doi.org/10.1016/j.phycom.2017.06.010
https://doi.org/10.1016/j.phycom.2017.06.010