Results 41 to 50 of about 90,397 (213)
Improvement and Application of Dijkstra Algorithms
: Taking urban express traffic as an example, this paper lists two optimization improvements of Dijkstra algorithm. One is to improve the calculation method of the algorithm to make the calculation more directional, so as to reduce the total amount of ...
He-Ming Bing, Lu Lai
semanticscholar +1 more source
In most games, an artificial pathfinding intelligence is required for traversing the fastest discovery. It is essential for many video games, particularly Role Playing Games (RPGs).
Riska Nurtantyo Sarbini +3 more
doaj +1 more source
Recent Application of Dijkstra’s Algorithm in the Process of Production Planning
This paper aims to develop a method that could serve as a tool for evaluating extracted raw materials in terms of use by considering the place of extraction and consumption.
M. Behún +4 more
semanticscholar +1 more source
Designing and implementing a Web-based real time routing service for crisis management (a case study for district 11 of Tehran) [PDF]
Timing framework associated with catastrophes is one of the most important issues in crisis management. In such cases, being immediate has a considerable importance and web based real-time routing service as an important tool has a significant role in ...
javad sadidi +2 more
doaj
An Enhanced Model for Dijkstra Algorithm: Case Study Nearest Hospital in Greater Cairo-Egypt [PDF]
The COVID-19 pandemic has increased the need for people to locate nearby healthcare facilities quickly, especially in densely populated countries like Egypt, where transportation networks are complex.
Hytham Ismail +3 more
doaj +1 more source
Genus Pseudohinnites Dijkstra, 1989 Pseudohinnites Dijkstra, 1989: 29. TYPE SPECIES (OD). — Pseudohinnites levii Dijkstra, 1989 (Recent, New Caledonia).Published as part of Dijkstra, Henk H.
Maestrati, Philippe, Dijkstra, Henk H.
core +1 more source
Finding the shortest path in a network is a classical problem, and a variety of search strategies have been proposed to solve it. In this paper, we review traditional approaches for finding shortest paths, namely, uninformed search, informed search and ...
Hoang Dat Pham +4 more
doaj +1 more source
Perancangan Robot Penelusur Menggunakan Algoritma Dijkstra dan Metode Maze Solver
Dalam sebuah eksplorasi terdapat berbagai macam hal yang ingin di telusuri, baik dalam area terbuka maupun sebuah area tertutup. Pada area tertutup seperti reruntuhan, banyak hal yang bisa terjadi dan dapat membingungkan serta membahayakan nyawa manusia.
Yusuf Anshori +2 more
doaj +1 more source
Parvamussium multiliratum Dijkstra 1995
Parvamussium retiolum Dijkstra, 1995 Parvamussium retiolum Dijkstra, 1995: 29, figs 39-42, 97. MATERIAL EXAMINED. — Coral Sea. Chesterfield Islands, 19°47’S, 158°44’E, 685-700 m (MUSORSTOM 5 stn CP 363), holotype spm (MNHN 21171). Solomon Islands.
Maestrati, Philippe, Dijkstra, Henk H.
core +1 more source
Solusi Optimal Pencarian Jalur Tercepat dengan Algoritma Hybrid Fuzzy-Dijkstra
Pada kasus pencarian jalur, seringkali hanya panjang dari tiap ruas jalan yang dipergunakan sebagai parameter. Dalam kenyataannya banyak faktor yang semestinya digunakan sebagai pertimbangan dalam menentukan rute yang dipilih.
Moch. Hannats Hanafi Ichsan +2 more
doaj +1 more source

