Results 191 to 200 of about 5,083,450 (268)

Complete-Coverage Path-Planning Algorithm Based on Transition Probability and Learning Perturbation Operator. [PDF]

Sensors (Basel)
Wang X, Han G, Tang J, Dai Z.
europepmc   +1 more source

A deep learning methodology for fully-automated quantification of calcific burden in high-resolution intravascular ultrasound images. [PDF]

Int J Cardiovasc Imaging
He X, Mohamed MO, Ng NYJ, Kumaran T, Bajaj R, Yap NAL, Erdogan E, Zeren G, Mathur A, Ulutas AE, Gao B, Zhang Y, Baumbach A, Dijkstra J, Bourantas CV.   +14 more
europepmc   +1 more source

AI-driven routing pipeline in software-defined networks using DQL: a mini review. [PDF]

Front Artif Intell
Goteti D, Reddy VK.
europepmc   +1 more source

GMM-HMM-Based Eye Movement Classification for Efficient and Intuitive Dynamic Human-Computer Interaction Systems. [PDF]

J Eye Mov Res
Xie J, Chen R, Liu Z, Zhou J, Hou J, Zhou Z.   +5 more
europepmc   +1 more source

An effective and open source interactive 3D medical image segmentation solution. [PDF]

Sci Rep
Gao Y, Chen X, Yang Q, Lasso A, Kolesov I, Pieper S, Kikinis R, Tannenbaum A, Zhu L.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A biobjective Dijkstra algorithm

European Journal of Operational Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio Sedeño-noda, Marcos Colebrook
openaire   +3 more sources

Application of improved Dijkstra algorithm in intelligent ship path planning

Chinese Control and Decision Conference, 2021
In order to ensure the safety of seafarer and comprehensively improve the intelligence of maritime field, the topic of unmanned ship has become more and more popular in recent years, and the ability of collision avoidance path planning of unmanned ship ...
Zhenyu Zhu, Lianbo Li, Wenhao Wu, Yang Jiao   +3 more
semanticscholar   +1 more source

Comparative Study Of Various Approaches Of Dijkstra Algorithm

2021 International Conference on Computing, Communication, and Intelligent Systems (ICCCIS), 2021
Dijkstra algorithm is not improved in terms of space and time-complexity, the algorithm is muddled to apply in network analysis for enormous test cases.
Divyam Verma, Devansh Messon, Mayank Rastogi, Ashutosh Kumar Singh   +3 more
semanticscholar   +1 more source

A Prim–Dijkstra Algorithm for Multihop Calibration of Networked Embedded Systems

IEEE Internet of Things Journal, 2021
The development of large-scale systems of networked embedded devices with sensing capabilities relies on the availability of low-cost and resource-constrained components However, the reduced precision and accuracy of low-cost sensors on board of low ...
Valerio Freschi, E. Lattanzi
semanticscholar   +1 more source

Dijkstra's algorithm in AGV

2014 9th IEEE Conference on Industrial Electronics and Applications, 2014
The path planning is a very important part of AGV control. Firstly, The OpenCV is called to fitting the contour of obstacles with polygon and to optimize the result. Then a model of AGV work space is built by the method of network topology. So the problem of AGV path planning can be transformed into the problem of searching for the shortest path of the
Duanling Li, Kun Niu
openaire   +1 more source