Results 171 to 180 of about 4,817 (226)
SciAgents: Automating Scientific Discovery Through Bioinspired Multi-Agent Intelligent Graph Reasoning. [PDF]
Adv MaterGhafarollahi A, Buehler MJ.
europepmc +1 more source
Visualization system to identify structurally vulnerable links in OHT railway network in semiconductor FAB using betweenness centrality. [PDF]
PLoS OneChoi J +5 more
europepmc +1 more source
ML-driven latency optimization for mobile edge computing in fiber-wireless access networks. [PDF]
MethodsXMarmat A, Thankachan D.
europepmc +1 more source
Pangenome-spanning epistasis and coselection analysis via de Bruijn graphs. [PDF]
Genome ResKuronen J +13 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
A biobjective Dijkstra algorithm
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio Sedeño-noda, Marcos Colebrook
openaire +2 more sources
Understanding Dijkstra Algorithm
SSRN Electronic Journal, 2013Dijkstra's algorithm (named after its discover, E.W. Dijkstra) solves the problem of finding the shortest path from a point in a graph (the source) to a destination. It turns out that one can find the shortest paths from a given source to all points in a graph in the same time, hence this problem is sometimes called the single-source shortest paths ...
openaire +1 more source
Dijkstra's algorithm and Google maps
Proceedings of the 2014 ACM Southeast Regional Conference, 2014Dijkstra's Algorithm is known as the shortest path source. In this paper, we discuss this Algorithm and the applications that the algorithm has on the modern day. In this study, we provide a pseudo-code of the algorithm. It is the backbone of every navigation system. Google Maps is a typical application of this Algorithm.
Daniel R. Lanning +2 more
openaire +1 more source
Proceedings of the International Symposium on Combinatorial Search, 2021
Dijkstra's single-source shortest-path algorithm (DA) is one of the well-known, fundamental algorithms in computer science and related fields. DA is commonly taught in undergraduate courses. Uniform-cost search (UCS) is a simple version of the best-first search scheme which is logically equivalent to DA.
openaire +1 more source
Dijkstra's single-source shortest-path algorithm (DA) is one of the well-known, fundamental algorithms in computer science and related fields. DA is commonly taught in undergraduate courses. Uniform-cost search (UCS) is a simple version of the best-first search scheme which is logically equivalent to DA.
openaire +1 more source
Two Block Partitioned Dijkstra Algorithms
2013 IEEE 78th Vehicular Technology Conference (VTC Fall), 2013The Dijkstra algorithm (DA) is a kind of tree search algorithm. The biggest advantage is that it has the smallest number of visited nodes among all optimal tree search algorithms. But stack sizes required by the DA are always too large to achieve. By partitioning the searching tree into blocks, two modified algorithms are proposed in this article to ...
Xinyu Mao, Yuxin Cheng, Haige Xiang
openaire +1 more source