Temat: Dijkstra algorithm - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Determination of the shortest path as the basis for examining the most weather favorable routes
Autorzy:: Medyna, P.
Mąka, M.
Powiązania:: https://bibliotekanauki.pl/articles/359105.pdf
Data publikacji:: 2012
Wydawca:: Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:: Dijkstra's algorithm
evolutionary algorithms
initial population
GFS land / ocean data
Opis:: Generating initial population of evolutionary algorithms used in the process of weather ship route optimization requires the determination of the area where it may find the points of designated routes. The problem may be a need to sail around the continent, circumnavigate the islands, and the restrictions from the ice fields and other closed areas. Comparing routes to the rhumb line or great circle may be also impossible. It is proposed to determinate the preliminary route using Dijkstra's algorithm using land / ocean data of the GFS model. It will be used during generation an initial population on the ocean area in these cases.
Źródło:: Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2012, 32 (104) z. 1; 29-33
1733-8670
2392-0378
Pojawia się w:: Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Tractography Methods in Preoperative Neurosurgical Planning
Autorzy:: Koryciński, Mateusz
Ciecierski, Konrad A.
Powiązania:: https://bibliotekanauki.pl/articles/1839329.pdf
Data publikacji:: 2021
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: artificial intelligence
diffusion tensor imaging
Dijkstra's algorithm
graph traversing
MRI
neural networks
tractography
Opis:: Knowledge of the location of nerve tracts during the surgical preoperative planning stage and during the surgery itself may help neurosurgeons limit the risk of causing neurological deficits affecting the patient’s essential abilities. Development of MRI techniques has helped profoundly with in vivo visualization of the brain’s anatomy, enabling to obtain images within minutes. Different methodologies are relied upon to identify anatomical or functional details and to determine the movement of water molecules, thus allowing to track nerve fibers. However, precise determination of their location continues to be a labor-intensive task that requires the participation of highly-trained medical experts. With the development of computational methods, machine learning and artificial intelligence, many approaches have been proposed to automate and streamline that process, consequently facilitating image-based diagnostics. This paper reviews these methods focusing on their potential use in neurosurgery for better planning and intraoperative navigation.
Źródło:: Journal of Telecommunications and Information Technology; 2021, 3; 78-85
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Zastosowanie informatyki w logistyce transportu
Application of computer science in transportation logistics
Autorzy:: Brzoza, A.
Muszyński, G.
Powiązania:: https://bibliotekanauki.pl/articles/317223.pdf
Data publikacji:: 2017
Wydawca:: Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:: logistyka transportu
informatyka w logistyce
planowanie transportu towarów
Dijkstra
algorytm Dijkstry
transport logistics
information in logistics
freight planning
Dijkstra's algorithm
Opis:: W artykule została omówiona logistyka transportu mająca coraz większe znaczenie w planowaniu transportu towarów. Ponieważ koszty transportu zależą od jego przewidywanego czasu dostarczenia oraz od środka transportu, stąd planowanie trasy przejazdu jest istotnym czynnikiem w logistyce transportu, która we współczesnym świecie nie może w pełni funkcjonować bez rozwiązań informatycznych. W artykule poddano analizie transport kolejowy w Szwajcarii, będący jednym z najbardziej rozwiniętych tego typu systemów transportowych w Europie. Obliczenia bazują na przykładowych danych dotyczących tras kolejowych narodowego przewoźnika w tym kraju z wyborem czasu przejazdu jako głównego kryterium wyznaczania optymalnej trasy przejazdu dla wybranych połączeń między miastami. Dla potrzeb analizy został stworzony program implementujący algorytm Dijkstry, który posłużył do wyszukiwania optymalnego połączenia między wskazanymi miastami według danego kryterium.
This article discusses some computer-based logistics solutions aimed to improve the planning process in freight transport. Since transport costs are dependent on the lead time and the transport mode, route planning is a crucial factor in transport logistics, which, these days, relies heavilyon computer technology. The study is focused on the rail transport system in Switzerland, known to be the most developed in Europe. The data used in the computations refers to rail routes of the national carrier in that country. The transportation time was the main criterion to select an optimal route between origin and destination. The analysis involved developing a program that implements Dijkstra’s algorithm to find an optimal connection between places according to the selected criterion.
Źródło:: Autobusy : technika, eksploatacja, systemy transportowe; 2017, 18, 6; 1335-1337, CD
1509-5878
2450-7725
Pojawia się w:: Autobusy : technika, eksploatacja, systemy transportowe
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Dijkstras algorithm revisited: the dynamic programming connexion
Autorzy:: Sniedovich, M.
Powiązania:: https://bibliotekanauki.pl/articles/970872.pdf
Data publikacji:: 2006
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: programowanie dynamiczne
badania operacyjne
Dijkstra's algorithm
dynamic programming
greedy algorithm
principle of optimality
successive approximation
operations research
computer science
Opis:: Dijkstra's Algorithm is one of the most popular algorithms in computer science. It is also popular in operations research. It is generally viewed and presented as a greedy algorithm. In this paper we attempt to change this perception by providing a dynamic programming perspective on the algorithm. In particular, we are reminded that this famous algorithm is strongly inspired by Bellman's Principle of Optimality and that both conceptually and technically it constitutes a dynamic programming successive approximation procedure par excellence. One of the immediate implications of this perspective is that this popular algorithm can be incorporated in the dynamic programming syllabus and in turn dynamic programming should be (at least) alluded to in a proper exposition/teaching of the algorithm.
Źródło:: Control and Cybernetics; 2006, 35, 3; 599-620
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Vessels Route Planning Problem with Uncertain Data
Autorzy:: Neumann, T.
Powiązania:: https://bibliotekanauki.pl/articles/115957.pdf
Data publikacji:: 2016
Wydawca:: Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:: maritime-related data
route planning
dempster-shafer theory (DST)
vessels route planning
Dijkstra's algorithm
decision rules
mathematical theory of evidence
uncertain data
Opis:: The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.
Źródło:: TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2016, 10, 3; 459-464
2083-6473
2083-6481
Pojawia się w:: TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: The use of the roadload application in geographical studies of flows generated by individual modes of transport
Autorzy:: Borowska-Stefańska, Marta
Kowalski, Micha
Wiśniewski, Szymon
Domagalski, Adam
Powiązania:: https://bibliotekanauki.pl/articles/1841142.pdf
Data publikacji:: 2020
Wydawca:: Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:: RoadLoad application
Dijkstra's algorithm
transport geography
modes of transport
spatial mobility
transport accessibility
aplikacja RoadLoad
algorytm Dijkstry
geografia transportu
rodzaje transportu
mobilność przestrzenna
dostępność transportowa
Opis:: The purpose of this article is to present the authors' own software for predicting changes in the density and directions of traffic flows and to compare overall results of research on transport accessibility with the results returned in the study of transport accessibility conducted with the software (isochronic accessibility). Developed for research purposes, the authors' application is based on Dijkstra's algorithm, which is classified as one of the greedy ones and does not always return optimum results, even though it is considered to be generally accurate. In the course of the research, it was stated that the implementation of Dijkstra's algorithm in the RoadLoad tool is suitable for studying and prognosing phenomena, under the assumption that there are detailed data on the point of departure and destination for each trip. The tool enables us to research a spatial (cumulated values of network load) as well as time-spatial (network load at virtually any time) dimension of the phenomenon. It cannot be applied, however, without the knowledge of the transport behavior characteristics of the users of the road system.
Źródło:: Transport Problems; 2020, 15, 4, cz. 2; 227-240
1896-0596
2300-861X
Pojawia się w:: Transport Problems
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: The use of the roadload application in geographical studies of flows generated by individual modes of transport
Autorzy:: Borowska-Stefańska, Marta
Kowalski, Micha
Wiśniewski, Szymon
Domagalski, Adam
Powiązania:: https://bibliotekanauki.pl/articles/1841150.pdf
Data publikacji:: 2020
Wydawca:: Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:: RoadLoad application
Dijkstra's algorithm
transport geography
modes of transport
spatial mobility
transport accessibility
aplikacja RoadLoad
algorytm Dijkstry
geografia transportu
rodzaje transportu
mobilność przestrzenna
dostępność transportu
Opis:: The purpose of this article is to present the authors' own software for predicting changes in the density and directions of traffic flows and to compare overall results of research on transport accessibility with the results returned in the study of transport accessibility conducted with the software (isochronic accessibility). Developed for research purposes, the authors' application is based on Dijkstra's algorithm, which is classified as one of the greedy ones and does not always return optimum results, even though it is considered to be generally accurate. In the course of the research, it was stated that the implementation of Dijkstra's algorithm in the RoadLoad tool is suitable for studying and prognosing phenomena, under the assumption that there are detailed data on the point of departure and destination for each trip. The tool enables us to research a spatial (cumulated values of network load) as well as time-spatial (network load at virtually any time) dimension of the phenomenon. It cannot be applied, however, without the knowledge of the transport behavior characteristics of the users of the road system.
Źródło:: Transport Problems; 2020, 15, 4, cz. 2; 227--240
1896-0596
2300-861X
Pojawia się w:: Transport Problems
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Dijkstra algorithm" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język