Results 31 to 40 of about 2,337,392 (235)

Heap-Dijkstra algorithm.

, 2013
Heap-Dijkstra algorithm.
Judy Qiu (338061), Jae Hong Shin (338059), Ganesh Moorthy (338060), Bing He (135034), Huijun Wang (288634), Pankaj Desai (338062), Jie Tang (46802), Bin Chen (63682), David J. Wild (152711), Yuyin Sun (338058), Ying Ding (152708)   +10 more
core   +1 more source

Solving the Shortest Total Path Length Spanning Tree Problem Using the Modified Sollin and Modified Dijkstra Algorithms

Science and Technology Indonesia, 2023
In a weighted connected graph, the shortest total path length spanning tree problem is a problem when we need to discover the spanning tree with the lowest total cost of all pairwise distances between its vertices.
Wamiliana, Reni Permata Sari, Astri Reformasari, Jani Suparman, Akmal Junaidi   +4 more
doaj   +3 more sources

Time-dependent Dijkstra algorithm

, 2015
Time-dependent Dijkstra ...
José D. Piñeiro (709998), Javier Hernández-Aceituno (709996), Leopoldo Acosta (709997)   +2 more
core   +1 more source

Robot Path Planning of Improved Adaptive Ant Colony System Algorithm Based on Dijkstra

Journal of Robotics, 2022
Path planning is one of the key technologies of robot. Aiming at the problems of slow convergence speed and inefficient search of traditional Ant Colony System Algorithm, an adaptive Ant Colony System Algorithm based on Dijkstra is proposed in the paper.
Chonglin Gu, Ansong Feng, Guozhan Wang, Xiqing Liu   +3 more
doaj   +1 more source

Oktatási célú grafikus szoftver készítése a Dijkstra és távolságvektor alapú útválasztó algoritmusok működésének szemléltetésére

, 2021
A szakdolgozatom célja a Dijkstra és a távolságvektor alapú útválasztás bemutatása. Mellette bevezetésként írok röviden a routerek közti útválasztásról. Röviden megemlítem a számítógépes hálózatok felépítését.
Uzonyi, Dávid
core  

An eikonal model with re-excitability for fast simulations in cardiac electrophysiology. [PDF]

J Physiol
Abstract figure legend Restitution properties obtained from cable‐equation simulations and anisotropic remeshing informed by local fibre orientation are combined in an eikonal model with re‐excitability. The resulting reduced electrophysiology model enables efficient simulations of recurrent activation patterns, here illustrated by atrial re‐entry ...
Gander L, Krause R, Sahli Costabal F, Pezzuto S.   +3 more
europepmc   +2 more sources

Pseudohinnites Dijkstra 1989

, 2017
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

Path Planning Algorithms for Smart Parking: Review and Prospects

World Electric Vehicle Journal
Path planning algorithms are crucial components in the process of smart parking. At present, there are many path planning algorithms designed for smart parking.
Zhonghai Han, Haotian Sun, Junfu Huang, Jiejie Xu, Yu Tang, Xintian Liu   +5 more
doaj   +1 more source

Parvamussium squalidulum Dijkstra 1995

, 2013
Parvamussium squalidulum Dijkstra, 1995 Parvamussium squalidulum Dijkstra, 1995: 32, figs 47-50. MATERIAL EXAMINED. — Lord Howe Rise. Kelso Bank, 24°11’S, 159°35’E, 270 m (MUSORSTOM 5 stn DW 277), holotype spm (MNHN 21169).
Maestrati, Philippe, Dijkstra, Henk H.
core   +1 more source

Delivery Route Management based on Dijkstra Algorithm

مجلة بغداد للعلوم, 2021
For businesses that provide delivery services, the efficiency of the delivery process in terms of punctuality is very important. In addition to increasing customer trust, efficient route management, and selection are required to reduce vehicle fuel costs
Ng Lih Sheng , Nureize Arbaiy, Chuah Chai Wen Wen , Pei-Chun Lin   +3 more
doaj   +1 more source