Zobrazeno 1 - 10
of 2 390
pro vyhledávání: '"k‐shortest path routing"'
Autor:
Farhan Khan, Sing Kiong Nguang
Publikováno v:
IET Intelligent Transport Systems, Vol 14, Iss 5, Pp 288-296 (2020)
Multi‐hop routing in vehicular ad‐hoc networks (VANETs) and wireless sensor networks has attracted significant interest of researchers in the wireless ad‐hoc networks community. Most multi‐hop routing protocols in VANET are based around the i
Externí odkaz:
https://doaj.org/article/34024ab166b94b66abeb069b9cf41c5a
Publikováno v:
Journal of Network and Computer Applications. 103:215-224
The unmanned aerial system (UAS), as a typical aeronautical Ad-hoc network (AANET) system, which is composed of unmanned aerial vehicle clusters has a lot of advantages such as flexible deployment, excellent cost-benefit ratio and free from the effec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7277a8aac934b87e6a5ecc3cdd9f8dd
https://doi.org/10.1016/j.jnca.2017.08.008
https://doi.org/10.1016/j.jnca.2017.08.008
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 29:144-155
The Random regular graph (RRG) has recently been proposed as an interconnect topology for future large scale data centers and HPC clusters. An RRG is a special case of directed regular graph (DRG) where each link is unidirectional and all nodes have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88b3465218ae75d1388412e5aac9877c
https://doi.org/10.1109/tpds.2017.2741492
https://doi.org/10.1109/tpds.2017.2741492
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
Autor:
Andrej Brodnik, Marko Grgurovič
Publikováno v:
Discrete Applied Mathematics. 231:119-130
Given an arbitrary directed graph G = ( V , E ) with non-negative edge lengths, we present an algorithm that computes all pairs shortest paths in time O ( m ∗ n + m lg n + n T ψ ( m ∗ , n ) ) , where m ∗ is the number of different edges contai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::560907c10cda93b8db59a92d41859ed6
https://doi.org/10.1016/j.dam.2017.03.008
https://doi.org/10.1016/j.dam.2017.03.008