Zobrazeno 1 - 10
of 1 403
pro vyhledávání: '"Suurballe's algorithm"'
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:
Theoretical Computer Science. 705:58-74
We propose a new type of network location problem for placing multiple but distinct facilities, called the p-service center problem. In this problem, we are to locate p facilities in the graph, each of which provides distinct service required by all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::534e40909c7cab7e960cdaee47af48b5
https://doi.org/10.1016/j.tcs.2017.09.034
https://doi.org/10.1016/j.tcs.2017.09.034
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
Publikováno v:
International Journal of Applied Information Systems. 12:22-26
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1d6124f89777d707f43e22aa00d3fe5
https://doi.org/10.5120/ijais2017451714
https://doi.org/10.5120/ijais2017451714
Autor:
Kumari Pritee, Rahul Dev Garg
Publikováno v:
International Journal of Advanced Remote Sensing and GIS. 6:2442-2448
Many route mappings were done with the help of API of Google maps but do not provide geospatial Routing functionality like overlay, interpolation etc. This project aims to find the shortest path between two or more points by using multipath Dijkstra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11a0feb582e51af7be1c9d7c3fe9aa60
https://doi.org/10.23953/cloud.ijarsg.321
https://doi.org/10.23953/cloud.ijarsg.321
Autor:
Z. Shakeri Kebria, E. Roghanian
Publikováno v:
Scientia Iranica. 24:2540-2549
This paper introduces a new method called multi-attribute Dijkstra that is an extension of Dijkstra to determine the shortest path between two points of a graph while arcs between points, in addition to the distance, have other attributes such as tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47cd52ed52fc84a3e413fcc4b54b7c25
https://doi.org/10.24200/sci.2017.4390
https://doi.org/10.24200/sci.2017.4390
Publikováno v:
Wireless Personal Communications. 98:1605-1635
Despite the wide improvement in wireless sensor networks, energy consumption is still considered as the most important challenge in this kind of network. Previous research studies have shown that a routing algorithm based on clustering could be a per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9854214a31da96fed2b680ad09f90d44
https://doi.org/10.1007/s11277-017-4937-1
https://doi.org/10.1007/s11277-017-4937-1
Autor:
Bahman Mehri
Publikováno v:
OLYMPIADS IN INFORMATICS. 11:71-74
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b9344283981a0bd8d78e3ccf62aff33
https://doi.org/10.15388/ioi.2017.special.11
https://doi.org/10.15388/ioi.2017.special.11
Autor:
Venkatesan T. Chakaravarthy, Prakash Murali, Fabio Checconi, Yogish Sabharwal, Fabrizio Petrini
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 28:2031-2045
We consider the single-source shortest path (SSSP) problem: given an undirected graph with integer edge weights and a source vertex $v$ , find the shortest paths from $v$ to all other vertices. In this paper, we introduce a novel parallel algorithm,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f3ec964974405ab8d312589f3fe081d
https://doi.org/10.1109/tpds.2016.2634535
https://doi.org/10.1109/tpds.2016.2634535
Autor:
K. Yu. Gorbunov, Vassily A. Lyubetsky
Publikováno v:
Journal of Communications Technology and Electronics. 62:653-662
A novel time- and memory-efficient algorithm for solving the problem of finding the most economical (i.e., having the lowest overall cost) transformation of an arbitrary oriented graph representing a disjoint union of chains and cycles into another g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af03f3314d0134873c73b7dc781ac79e
https://doi.org/10.1134/s1064226917060092
https://doi.org/10.1134/s1064226917060092