Results 51 to 60 of about 90,397 (213)
Parvamussium retiaculum Dijkstra 1995
Parvamussium retiaculum Dijkstra, 1995 Parvamussium retiaculum Dijkstra, 1995: 28, figs 35-38. MATERIAL EXAMINED. — New Caledonia. Southern New Caledonia, 23°05’S, 167°45’E, 680-700 m, holotype spm (MNHN 24266). Vanuatu. SANTO 2006, stn AT19, 15°
Maestrati, Philippe, Dijkstra, Henk H.
core +1 more source
Analysis of Dijkstra’s Algorithm and A* Algorithm in Shortest Path Problem
Finding the shortest path in direction effective is essential. To solve this shortest path problem, we usually using Dijkstra or A* algorithm. These two algorithms are often used in routing or road networks. This paper’s objective is to compare those two
D. Rachmawati, L. Gustin
semanticscholar +1 more source
Parvamussium undisonum Dijkstra 1995
Parvamussium undisonum Dijkstra, 1995 Parvamussium undisonum Dijkstra, 1995: 37, figs 55-58. MATERIAL EXAMINED. — Loyalty Islands. 20°48’S, 167°05’E, 700 m (MUSORSTOM 6 stn DW 489), holotype spm (MNHN 21421). Norfolk Ridge. TERRASSES, stn DW 3036,
Maestrati, Philippe, Dijkstra, Henk H.
core +1 more source
Implementasi Algoritma Dijkstra dan Algoritma Semut Untuk Analisis Rute Transjogja Berbasis Android
Penelitian ini adalah untuk membandingkan kinerja dari algoritma Dijkstra dan Algoritma Semut (Ant Colony Optimization) yang dimana kedua Algoritma tersebut dapat digunakan untuk menentukan jalur terpendek dan tercepat. Algoritma Dijkstra memiliki waktu
Sunardi Sunardi +2 more
doaj +1 more source
The development of multicore hardware has provided many new development opportunities for many application software algorithms. Especially, the algorithm with large calculation volume has gained a lot of room for improvement.
Bo Zhang, De Ji Hu
doaj +1 more source
Cyclopecten cancellus Dijkstra 1991
<i>Cyclopecten cancellus</i> Dijkstra, 1991 <p> <i>Cyclopecten cancellus</i> Dijkstra, 1991: 21, figs 66-70.</p> <p> MATERIAL EXAMINED. — <b>Fiji</b>.
Maestrati, Philippe, Dijkstra, Henk H.
core +1 more source
Implementation of Dijkstra's Algorithm to Determine the Shortest Route in a City
This study discusses the search for the shortest route from city A to city G using the Dijkstra algorithm based on distance traveled. Dijkstra's algorithm is one of the algorithms used to solve the shortest path and does not have a negative cost.
M. F. Fahroza +3 more
semanticscholar +1 more source
Hyalopecten tydemani Dijkstra 1990
Hyalopecten tydemani Dijkstra, 1990 Palliolum (Hyalopecten) tydemani Dijkstra, 1990: 7, pl. 2, fig. 13. Hyalopecten tydemani – Dijkstra & Maestrati 2008:103, figs 42, 43. MATERIAL EXAMINED. — Indonesia.
Maestrati, Philippe, Dijkstra, Henk H.
core +1 more source
Parvamussium virgatum Dijkstra 1991
<i>Parvamussium virgatum</i> Dijkstra, 1991 <p> <i>Parvamussium virgatum</i> Dijkstra, 1991: 20, figs 62-65.</p> <p> MATERIAL EXAMINED. — <b>Solomon Islands</b>.
Maestrati, Philippe, Dijkstra, Henk H.
core +1 more source
Zendingsarchitect Pieter Simon Dijkstra en zijn Nederlandse werken
Pieter Simon Dijkstra (1884-1968) is regarded as a noted Protestant church designer in South Africa, but his contribution to the built environment in the Netherlands is much less well known.
Marieke Kuipers, Nicholas Clarke
doaj +1 more source

