Results 61 to 70 of about 5,425,704 (264)
Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bali
Journal of Physics: Conference Series, 2019 Bali is one of many small island in Indonesia and referred as “The Island of Gods”. Bali has varieties of tourist destination e.g. art villages, ecotourism, historical building, spiritual tourism and temples.
A. Fitriansyah +3 more
semanticscholar +1 more source
Path‐Based Deep Reinforcement Learning for On‐Board Routing in Satellite Constellation Networks
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT Efficient usage of available network resources is a crucial factor for broadband services in interconnected satellite constellations. To meet required quality of service standards under heavy network loads, it is essential to optimize traffic distribution among the intersatellite links. To address this challenge, we propose an adaptive traffic
Manuel M. H. Roth +4 more
wiley +1 more source
Potential of Using the Ant Colony Optimization Algorithm for Optimal Network Path Selection
Proceedings of the International Conference on Applied Innovations in ITThe article considers the possibilities of using the Ant Colony Optimization algorithm to find the shortest path in the network based on the selected criteria. Its performance is compared to Dijkstra's algorithm and LCA algorithm, which is widely used in
Oleksandra Yaroshevska, Veronika Kirova
doaj +1 more source
Sustainable Development, EarlyView.ABSTRACT Education is a cornerstone of sustainable development, yet large disparities in access persist across and within countries—particularly in Africa, where millions remain underserved. Among several factors influencing educational participation, physical accessibility to schools (in terms of travel time) is not comprehensively understood ...
Diana Jaramillo‐Araujo, Jim W. Hall
wiley +1 more source
Method of Path Selection in the Graph - Case Study [PDF]
TransNav, 2014 This paper presents a different perspective on the Dijkstra algorithm. In this paper algorithm will be used in the further analysis to find additional paths between nodes in the maritime sector.
Tomasz Neumann
doaj +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
QuickMatch--a very fast algorithm for the assignment problem [PDF]
, 1993 Includes bibliographical references (p. 25-27).James B.
core
Dijkstra’s Algorithm on Semigraph
WSEAS TRANSACTIONS ON COMPUTER RESEARCHThe study of graph theory helps us in understanding the relationship between two nodes. Semigraphs are generalizations of graphs where the relationship occurs between more than two nodes. It provides solutions to issues with layout, matching, networking, optimization, etc.
Pranjal Sen +4 more
openaire +1 more source
A QUANTUM IMPROVEMENT ON DIJKSTRA’S ALGORITHM FOR COMPUTER NETWORK ROUTING [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2008 The aim of this paper is to improve the Dijkstra algorithm which is widely used in the internet routing. Quantum computing approach is used to improve the work of Dijkstra algorithm for network routing by exploiting the massive parallelism existing in ...
Rana F. Ghani, Ahmed T. Sadik
doaj +1 more source
International Journal of Intelligent Engineering and Systems, 2018 In emergencies cases, the main problem is how to arrive to an incident location in a minimum time. In such cases, using the classical distance based routing techniques does not always provide the optimal path in the time needed. In this paper, we present
Sayed Ahmed +2 more
semanticscholar +1 more source