Results 61 to 70 of about 5,083,450 (268)

Dijkstra's algorithm to find the nearest vaccine location

Procedia Computer Science, 2023
Since the start of Covid-19 pandemic has made many people look for vaccine locations. In general, Dijkstra algorithm is used to find the shortest path. The shortest path problem concentrates on finding the path with the minimum distance. The Dijkstra algorithm was chosen because it has several advantages other than advantageous in terms of running time
Jason, Siever, Melvin, Valentino, Alvin, Suryaningrum, Kristien Margi, Yunanda, Rezki   +4 more
openaire   +2 more sources

Information-Aware Secure Routing in Wireless Sensor Networks

Sensors, 2019
Secure routing is crucial for wireless sensor networks (WSNs) because they are vulnerable to various attacks. In this paper, we propose a new secure routing protocol for WSNs in the presence of malicious nodes.
Qiong Shi, Li Qin, Yinghua Ding, Boli Xie, Jiajie Zheng, Lipeng Song   +5 more
doaj   +1 more source

An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018) [PDF]

, 2019
This report presents an implementation the Dijkstra algorithm applied to a type V fuzz graph. This new algorithm can find the shortest path in a graph with edge costs are defined as positive triangular fuzzy ...
Alonso, Sira, Ariza-Quintana, Alfonso, Joya-Caparrós, Gonzalo, Valdés, Lissette   +3 more
core   +1 more source

Optimal Path in Two and Three Dimensions

, 1998
We apply the Dijkstra algorithm to generate optimal paths between two given sites on a lattice representing a disordered energy landscape. We study the geometrical and energetic scaling properties of the optimal path where the energies are taken from a ...
Havlin, Shlomo, Nazaryev, Alexander L., Schwartz, Nehemia   +2 more
core   +1 more source

What to Make and How to Make It: Combining Machine Learning and Statistical Learning to Design New Materials

Advanced Intelligent Discovery, EarlyView.
Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley   +1 more source

PENERAPAN ALGORITMA DIJKSTRA PADA APLIKASI JASA TRANSPORTASI ONLINE DI KOTA MEDAN

Al-Ulum, 2022
This study aims to determine the shortest route in the application of online transportation services which is the main attraction for entrepreneurs who want to start looking for their fortune in technology and transportation, given the enormous ...
abdul alfattah hidayah
doaj   +1 more source

Computing the Greedy Spanner in Linear Space [PDF]

, 2013
The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time.
Alewijnse, Sander P. A., Bouts, Quirijn W., Brink, Alex P. ten, Buchin, Kevin   +3 more
core   +2 more sources

Multiobjective Environmental Cleanup with Autonomous Surface Vehicle Fleets Using Multitask Multiagent Deep Reinforcement Learning

Advanced Intelligent Systems, EarlyView.
This study presents a multitask strategy for plastic cleanup with autonomous surface vehicles, combining exploration and cleaning phases. A two‐headed Deep Q‐Network shared by all agents is traineded via multiobjective reinforcement learning, producing a Pareto front of trade‐offs.
Dame Seck, Samuel Yanes, Manuel Perales, Daniel Gutiérrez, Sergio Toral   +4 more
wiley   +1 more source

Research on optimal emergency evacuation path for mine water inrush based on dynamic D-K algorithm

Meikuang Anquan
After the occurrence of mine water inrush, choosing the appropriate emergency evacuation path is very important to reduce the casualty and the mine accident level.
Biao XIE, Dengkui ZHU, Baichen LI, Qianru LEI, Jingjing YU, Jiaqi HU, Xinghua ZHANG   +6 more
doaj   +1 more source

Dijkstra’s Algorithm on Semigraph

WSEAS TRANSACTIONS ON COMPUTER RESEARCH
The 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, Dhruba Jyoti Nath, Abdur Rohman, Surajit Kr. Nath, Moushumi Mitra   +4 more
openaire   +1 more source