Results 221 to 230 of about 184,209 (271)
Some of the next articles are maybe not open access.
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
Parvamussium undisonum Dijkstra 1995
2008Published as part of Dijkstra, Henk H. & Maestrati, Philippe, 2008, New species and new records of deep-water Pectinoidea (Bivalvia: Propeamussiidae, Entoliidae and Pectinidae) from the South Pacific, pp.
Dijkstra, Henk H., Maestrati, Philippe
openaire +2 more sources
2018
Published as part of Dijkstra, Henk H. & Beu, Alan G., 2018, Living Scallops of Australia and Adjacent Waters (Mollusca: Bivalvia: Pectinoidea: Propeamussiidae, Cyclochlamydidae and Pectinidae), pp. 113-330 in Records of the Australian Museum (Rec. Aust. Mus.) (Rec. Aust.
Dijkstra, Henk H., Beu, Alan G.
openaire +1 more source
Published as part of Dijkstra, Henk H. & Beu, Alan G., 2018, Living Scallops of Australia and Adjacent Waters (Mollusca: Bivalvia: Pectinoidea: Propeamussiidae, Cyclochlamydidae and Pectinidae), pp. 113-330 in Records of the Australian Museum (Rec. Aust. Mus.) (Rec. Aust.
Dijkstra, Henk H., Beu, Alan G.
openaire +1 more source
Cyclopecten kapalae Dijkstra 1990
2012Cyclopecten kapalae Dijkstra, 1990 Cyclopecten kapalae Dijkstra, 1990: 29, figs 1-5. MATERIAL EXAMINED. — Australia. New South Wales, off Sydney, 914- 907 m, holotype spm (AMS C.155831.1). Vanuatu. SANTO 2006, stn AT19, 15°40.8’S, 167°00.5’E, 503-600 m, 6 lv, 4 rv. — Stn DB69, 15°24.4’S, 167°13.0’E, 38 m, 1 spm. DISTRIBUTION.
Dijkstra, Henk H., Maestrati, Philippe
openaire +1 more source
A New Algorithm Based on Dijkstra for Vehicle Path Planning Considering Intersection Attribute
IEEE Access, 2021Dan-Dan Zhu
exaly
2017
This Chapter focuses on the approach of Dijkstra, Hoare and Parnas. We discuss the calculus of weakest preconditions developed by Dijkstra and the axiomatic semantics of programming languages developed by Hoare. We then discuss the classical engineering approach of Parnas and his tabular expressions.
openaire +1 more source
This Chapter focuses on the approach of Dijkstra, Hoare and Parnas. We discuss the calculus of weakest preconditions developed by Dijkstra and the axiomatic semantics of programming languages developed by Hoare. We then discuss the classical engineering approach of Parnas and his tabular expressions.
openaire +1 more source
A Heuristic Integrated Scheduling Algorithm Based on Improved Dijkstra Algorithm
Electronics (Switzerland), 2023Zhiqiang Xie
exaly

