Zobrazeno 1 - 10
of 1 553
pro vyhledávání: '"Constrained Shortest Path First"'
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:
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
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
Publikováno v:
Transportation Research Part D: Transport and Environment. 57:458-473
This study aims to determine an eco-friendly path that results in minimum CO2 emissions while satisfying a specified budget for travel time. First, an aggregated CO2 emission model for light-duty cars is developed in a link-based level using a suppor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d456773904f414fc8e376a98f46e6562
https://doi.org/10.1016/j.trd.2017.10.001
https://doi.org/10.1016/j.trd.2017.10.001
Autor:
Stanko Dimitrov, Jiaxin Liu
Publikováno v:
Networks. 71:120-135
In this article, we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider in this article we only requ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c046d7c0c45af9be149dc61cfacd1778
https://doi.org/10.1002/net.21792
https://doi.org/10.1002/net.21792
Autor:
Samarjit Kar, Saibal Majumder
Publikováno v:
Journal of Ambient Intelligence and Humanized Computing. 9:1835-1859
Shortest path problem in real life applications has to deal with multiple criteria. This article intends to solve a proposed multi-criteria shortest path problem of a weighted connected directed network whose associated edge weights are represented a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0780802972da15418a65642c554538f7
https://doi.org/10.1007/s12652-017-0601-6
https://doi.org/10.1007/s12652-017-0601-6
Autor:
Tamás Kis, Markó Horváth
Publikováno v:
Optimization Letters. 12:475-483
In the resource constrained shortest path problem we are given a directed graph along with a source node and a destination node, and each arc has a cost and a vector of weights specifying its requirements from a set of resources with finite budget li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb7f1c8f403319f7295aeeb8bc7a55b7
https://doi.org/10.1007/s11590-017-1212-z
https://doi.org/10.1007/s11590-017-1212-z