Results 71 to 80 of about 2,337,392 (235)
Efficient heuristics for the Steiner forest problem
International Transactions in Operational Research, EarlyView.Abstract Let G=(V,E)$G = (V, E)$ be a connected undirected graph, V$V$ a set of nodes, E$E$ a set of edges, |V|=n$|V| = n$, and |E|=m$|E| = m$. Given a non‐negative weight function w:E→R+$w: E \rightarrow \mathbb {R}^+$ associated with its edges, a set τ={Ti⊆V|i=1,…,p}$\tau = \lbrace T_i \subseteq V | i = 1, \ldots, p\rbrace$ of terminal sets Ti$T_i ...
Murilo Stockinger +4 more
wiley +1 more source
Parallelizing Dijkstra\u27s Algorithm [PDF]
, 2021 Dijkstra’s algorithm is an algorithm for finding the shortest path between nodes in a graph. The algorithm published in 1959 by Dutch computer scientist Edsger W. Dijkstra, can be applied on a weighted graph.
He, Mengqing
core
Modelling and Simulation in Engineering, 2014 Multiobjective optimization methods for routing in static wireless mesh networks (WMNs), with more than one QoS measure to be optimized, are highly challenging. To optimize the performance for a given end-to-end route in a static network, the most common
Nuha A. S. Alwan
doaj +1 more source
Periodontology 2000, EarlyView.Abstract Background Artificial intelligence (AI) is increasingly gaining attention in the field of periodontology and implant dentistry. Currently developed models can support diagnosis, treatment planning, and maintenance monitoring. However, most of the available literature is based on retrospective and often single‐modality data sets.
Aminollah Khormali +2 more
wiley +1 more source
Dijkstra’s Algorithm on Semigraph
WSEAS TRANSACTIONS ON COMPUTER RESEARCHThe study of graph theory helps us in understanding the relationship between two nodes. Semigraphs are generalizations of graphs where the relationship occurs between more than two nodes. It provides solutions to issues with layout, matching, networking, optimization, etc.
Pranjal Sen +4 more
openaire +1 more source
Parvamussium retiaculum Dijkstra 1995
, 2017 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, BIOCAL, stn DW51, holotype spm (MNHN-IM-2000-24266). Solomon
Maestrati, Philippe, Dijkstra, Henk H.
core +1 more source
IEEE AccessThis study presents an enhanced path planning framework for mobile robots operating in environments containing both static and dynamic obstacles. The proposed approach introduces the recursive heatmap Dijkstra (RH-Dijkstra) algorithm, which extends the ...
Baris Yasin Demir, Yavuz Eren
doaj +1 more source
International Journal of Advanced Robotic Systems, 2020 Safe lane changing of the dynamic industrial park and port scenarios with autonomous trucks involves the problem of planning an effective and smooth trajectory.
Feng Zhang, Ranfei Xia, Xinxing Chen
doaj +1 more source
Multi‐objective maritime vessel routing with safety considerations
International Transactions in Operational Research, Volume 34, Issue 1, Page 337-371, January 2027.Abstract The routing of maritime vessels is a challenging optimization problem that involves finding an adequate balance between conflicting and multiple objectives. This paper proposes a methodology based on inverse optimization to find appropriate objective weights that account for conflicting objectives. To formulate the inverse optimization problem,
Nazanin Sharif +4 more
wiley +1 more source
Parvamussium virgatum Dijkstra 1991
, 2017 Parvamussium virgatum Dijkstra, 1991 Parvamussium virgatum Dijkstra, 1991: 20, figs 62-65. MATERIAL EXAMINED. — Indonesia. Banda Sea,Tukang Besi Islands, NW of Binongko, 5°52.5’S, 123°58.5’E, 250-290 m (SNELLIUS-II, stn 4.033), holotype lv (RMNH ...
Maestrati, Philippe, Dijkstra, Henk H.
core +1 more source