Bibliographies thématiques / Algorithm of Dijkstra

Sommaire

  1. Articles de revues
  2. Thèses
  3. Livres
  4. Chapitres de livres
  5. Actes de conférences

Littérature scientifique sur le sujet « Algorithm of Dijkstra »

Auteur : Grafiati
Publié le 4 juin 2021
Mis à jour le 17 février 2022

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Algorithm of Dijkstra ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Algorithm of Dijkstra"

1

Dermawan, Tri Setya. « Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train ». IJID (International Journal on Informatics for Development) 7, no 2 (7 janvier 2019) : 8. http://dx.doi.org/10.14421/ijid.2018.07202.

Texte intégral
Résumé :
Abstract - The best route is the path found based on the minimum price of a train journey using the Dijkstra and Floyd-Warshall algorithms. This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The results of route discovery will be displayed in a web-based application using the PHP programming language and MySQL database. The results of these two algorithms are compared using 4 parameters: time complexity, memory complexity, level of completion and level of optimization.Based on the comparison results from the implementation that Dijkstra's algorithm has a time complexity of 81 faster than the Floyd-Warshall algorithm. For the memory complexity, Dijkstra's algorithm uses a memory of 512616 bytes less than the Floyd-Warshall algorithm for the executive category. Whereas for the economic category the Dijkstra algorithm uses a memory of 482488 bytes less than the Floyd-Warshall algorithm. For the level of completion of the two algorithms, there is no error. In addition, for the level of optimization the Dijkstra algorithm has advantages in this study, namely the data used is dynamic or variable data in each stage of the process.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Wayahdi, Muhammad Rhifky, Subhan Hafiz Nanda Ginting et Dinur Syahputra. « Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path ». International Journal of Advances in Data and Information Systems 2, no 1 (1 février 2021) : 45–52. http://dx.doi.org/10.25008/ijadis.v2i1.1206.

Texte intégral
Résumé :
The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem. The purpose of this study is to analyze the Greedy, A-Star, and Dijkstra algorithms in the process of finding the shortest path. The author wants to compare the effectiveness of the three algorithms in the process of finding the shortest path in a path or graph. From the results of the research conducted, the author can conclude that the Greedy, A-Star, and Dijkstra algorithms can be a solution in determining the shortest path in a path or graph with different results. The Greedy algorithm is fast in finding solutions but tends not to find the optimal solution. While the A-Star algorithm tends to be better than the Greedy algorithm, but the path or graph must have complex data. Meanwhile, Dijkstra's algorithm in this case is better than the other two algorithms because it always gets optimal results.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Sedeño-noda, Antonio, et Marcos Colebrook. « A biobjective Dijkstra algorithm ». European Journal of Operational Research 276, no 1 (juillet 2019) : 106–18. http://dx.doi.org/10.1016/j.ejor.2019.01.007.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Dinitz, Yefim, et Rotem Itzhak. « Hybrid Bellman–Ford–Dijkstra algorithm ». Journal of Discrete Algorithms 42 (janvier 2017) : 35–44. http://dx.doi.org/10.1016/j.jda.2017.01.001.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Ding, Ming Li. « Optimal Path Algorithm Analysis of GPS Navigation Based on A* Algorithm ». Applied Mechanics and Materials 484-485 (janvier 2014) : 982–85. http://dx.doi.org/10.4028/www.scientific.net/amm.484-485.982.

Texte intégral
Résumé :
The optimal path algorithm analysis of GPS navigation in taxi management system based on A* algorithm was introduced in this paper. Through improving the traditional Dijkstra algorithm and avoiding problems such as time-consuming and low efficiency in Dijkstra algorithm with traversal search for each node, A* algorithm could help the taxi find the optimal path and bring convenience for traffic management.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Maekawa, Kotaro, Kazuhito Sawase et Hajime Nobuhara. « Multi-Resolution Dijkstra Method Based on Multi-Agent Simulation and its Application to Genetic Algorithm for Classroom Optimization ». Journal of Advanced Computational Intelligence and Intelligent Informatics 18, no 2 (20 mars 2014) : 113–20. http://dx.doi.org/10.20965/jaciii.2014.p0113.

Texte intégral
Résumé :
The combinatorial optimization problem of university classroom schedule assignments is formulated using multiagent simulation and genetic algorithms in the evaluation and optimization process. The method we propose consists of global and local multiagent planning. Conventional global planning requires setting subgoals manually, which became a bottleneck in optimization. To solve this problem, a multi-resolution Dijkstra method for selected autonomously, assuming eight classrooms as a real University of Tsukuba building and 250 agents, we confirmed the effectiveness of the proposed multi-resolution Dijkstra’s algorithm as for both global and local route selections, compared to the uniform Dijkstra’s method.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Hartanto, Anggit Dwi, Aji Surya Mandala, Dimas Rio P.L., Sidiq Aminudin et Andika Yudirianto. « Implementasi Algoritma Dijkstra Pada Game Pacman ». CCIT Journal 12, no 2 (19 août 2019) : 170–76. http://dx.doi.org/10.33050/ccit.v12i2.687.

Texte intégral
Résumé :
Pacman is one of the labyrinth-shaped games where this game has used artificial intelligence, artificial intelligence is composed of several algorithms that are inserted in the program and Implementation of the dijkstra algorithm as a method of solving problems that is a minimum route problem on ghost pacman, where ghost plays a role chase player. The dijkstra algorithm uses a principle similar to the greedy algorithm where it starts from the first point and the next point is connected to get to the destination, how to compare numbers starting from the starting point and then see the next node if connected then matches one path with the path). From the results of the testing phase, it was found that the dijkstra algorithm is quite good at solving the minimum route solution to pursue the player, namely by getting a value of 13 according to manual calculations
Styles APA, Harvard, Vancouver, ISO, etc.
8

Kartika, Winanda. « MODEL TRANSPORTASI PENGIRIMAN PRODUK PERISHABLE DENGAN MULTI KENDARAAN ». Jurnal Manajemen Industri dan Logistik 3, no 1 (10 mai 2019) : 57–74. http://dx.doi.org/10.30988/jmil.v3i1.72.

Texte intégral
Résumé :
Abstract : According to Graf theory, the shortest path determination is a problem of looking for a path between two vertices in a weighted graph to obtain the minimum amount of weight.The determination of the shortest path problem also called optimization problem. Several algorithms have been developed in solving this problem. Each algorithm has a different way of solving a particular problem. In this study, the development of algorithms was carried out to determine the critical path from one origin point to one destination point on a network for the delivery of perishable products that limited time window to minimize the total cost and the selection of vehicles that will be used for solving the problem.The Algorithm that developed is Dijkstra algorithm. The first stages of the algorithm development is to modify the network of the studied problem by making the network replication. The second stage is to make problem-solving steps to minimize the total cost, consists of a fixed cost, variable cost, vehicle turnover costs, deterioration cost and parking fees with modified Dijkstra algorithm because the problems can not be modeled mathematically.To test the developed algorithm, we used numerical examples with hypothetical dataKeywords: perishable product; deterioration; time window; modified Dijkstra algorithmAbstrak : Menurut teori Graf, penentuan rute terpendek merupakan suatu persoalan mencari lintasan antara dua buah simpul pada graf berbobot untuk mendapatkan jumlah bobot yang paling minimum. Permasalahan penentuan rute terpendek disebut juga masalah optimasi.Beberapa algoritma telah dikembangkan dalam pemecahan masalah ini. Setiap algoritma memiliki cara yang berbeda dalam menyelesaikan suatu permasalahan tertentu. Pada penelitian ini, dilakukan pengembangan algoritma untuk menentukan lintasan kritis dari satu titik asal ke satu titik tujuan pada suatu jaringan untuk pengiriman produk perishable dan dibatasi jendela waktu dengan meminimumkan total biaya sekaligus pemilihan jenis kendaraan yang akan digunakan untuk pemecahan masalah. Algoritma yang dikembangkan adalah Algoritma Dijkstra. Tahapan awal pengembangan algoritma adalah memodifikasi jaringan dari masalah yang diteliti dengan cara membuat replikasi jaringan. Tahapan kedua adalah membuat langkah pemecahan masalah untuk meminimumkan total biaya yaitu biaya tetap, biaya variabel, biaya pergantian kendaraan, biaya deteriorasi dan biaya tunggu dengan modifikasi Algoritma Dijkstra. Modifikasi Dijkstra dilakukan karena permasalahan yang diteliti tidak bisa dimodelkan secara matematis. Pengujian algoritma menggunakan contoh numerik dengan data hipotetik.Kata kunci: produk perishable; deteriorasi; jendela waktu; modifikasi Algoritma Dijkstra.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Sun, Ya Qi, Yu Liu et Kuo Hua Xiao. « Shortest Travel Path Searching System Based on Dijkstra Algorithm ». Applied Mechanics and Materials 198-199 (septembre 2012) : 1395–98. http://dx.doi.org/10.4028/www.scientific.net/amm.198-199.1395.

Texte intégral
Résumé :
The existing transportation service system in public travel route can not satisfy the people's actual travel need because of various technologies reasons. In our study, we set the tourist attractions as a vertex, and simplified the traditional algorithm for complex network computing. Aim to use the advantage of Dijkstra algorithm, the Dijkstra algorithm was applied to tourism path search. The experimental results have illustrated that the Dijkstra algorithm can accomplish a good result in search efficiency.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Sun, Hong Xia, et Zheng Zhang. « Application of Shortest-Path Algorithm in Embedded GIS System ». Advanced Materials Research 663 (février 2013) : 626–31. http://dx.doi.org/10.4028/www.scientific.net/amr.663.626.

Texte intégral
Résumé :
The shortest-path is an important issue in GIS network analysis, and its implementation in embedded systems has already been used widely in the mobile-device-based GPS navigation and city emergency response system fields. Based on our analysis and verification of the Dijkstra algorithm’s application to road network analysis, we presented in detail the design and program implementation of the Dijkstra algorithm and its flow chart. In this paper, the shortest-path example based on Dijkstra algorithm，which was developed in the MapXmobile5.0 and EVC4.0 environment, has been applied to embedded GIS system successfully. The comparison between the results from the program and manually obtained results has shown the Dijkstra algorithm’s feasibility and accuracy.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Algorithm of Dijkstra"

1

Oliveira, Erneson Alves de. « Geração de fraturas autossimilares em meios desordenados : técnicas do caminho crítico e do caminho mínimo ». reponame:Repositório Institucional da UFC, 2008. http://www.repositorio.ufc.br/handle/riufc/9657.

Texte intégral
Résumé :
OLIVEIRA, Erneson Alves de. Geração de fraturas autossimilares em meios desordenados: técnicas do caminho crítico e do caminho mínimo. 2008. 54 f. Dissertação (Mestrado em Física) - Programa de Pós-Graduação em Física, Departamento de Física, Centro de Ciências, Universidade Federal do Ceará, Fortaleza, 2008.
Submitted by Edvander Pires (edvanderpires@gmail.com) on 2014-11-03T20:05:53Z No. of bitstreams: 1 2008_dis_eaoliveira.pdf: 13308297 bytes, checksum: 51bfea9dc79470d1077454f8be1b593a (MD5)
Approved for entry into archive by Edvander Pires(edvanderpires@gmail.com) on 2014-11-03T20:12:15Z (GMT) No. of bitstreams: 1 2008_dis_eaoliveira.pdf: 13308297 bytes, checksum: 51bfea9dc79470d1077454f8be1b593a (MD5)
Made available in DSpace on 2014-11-03T20:12:15Z (GMT). No. of bitstreams: 1 2008_dis_eaoliveira.pdf: 13308297 bytes, checksum: 51bfea9dc79470d1077454f8be1b593a (MD5) Previous issue date: 2008
In this work we propose two models for fracture generation in regular substrates. In the first model, we iteratively apply the concept of critical path to systematically determine the lower “conductivity” element in the connected spanning network. At each iteration, once these elements are identified as local “cracks ́ ́, they are permanently removed from the structure up to the point in which a macroscopic fracture can destroy the global network connectivity. This fracture is then topologically characterized as self-similar with fractal dimension Dp ≈ 1.21. In the second model, we employ the algorithm of Dijkstra to determine the minimal path in a random energy landscape and remove its highest energy element. As in the previous model, these elements are considered to be local “cracks ́ ́ till a subset of them can be identified as a macroscopic fracture. The average over many samples of fractures calculated for different system sizes reveals the presence of a self-similar structure with fractal dimension Df ≈ 1.21. The resemblance between the two exponents Dp e Df suggests that the two models belong to the same universality class.
Neste trabalho propomos dois modelos para a geração de fraturas em substratos regulares. No primeiro modelo, empregamos iterativamente o conceito de caminho crítico para determinar sistematicamente o elemento de menor “condutividade” da rede. Estes elementos são então identificados como “falhas” e removidos permanentemente da estrutura até que uma fratura macroscópica destrua a conectividade global da rede. Uma vez detectada, esta fratura é caracterizada topologicamente como uma estrutura auto-similar de dimensão fractal Dp ≈ 1.21. No segundo modelo, empregamos iterativamente o algoritmo de Dijkstra para determinar o caminho mínimo em uma paisagem aleatória, retirando sistematicamente desta estrutura o elemento de maior energia. Como no modelo anterior, estes elementos são identificados como “falhas” até que um conjunto conecto deles resulte em uma fratura macroscópica. A média realizada sobre várias amostras de fraturas em diferentes tamanhos de substratos revela a presença de uma estrutura auto-similar de dimensão fractal Df ≈ 1.21. A semelhança numérica entre os expoentes Dp e Df sugere que os dois modelos pertencem à mesma classe de universalidade.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Oliveira, Erneson Alves de. « GeraÃÃo de fraturas auto-similares em meios desordenados : tÃcnicas do caminho crÃtico e do caminho mÃnimo ». Universidade Federal do CearÃ, 2008. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1938.

Texte intégral
Résumé :
FundaÃÃo de Amparo à Pesquisa do Estado do CearÃ
CoordenaÃÃo de AperfeiÃoamento de NÃvel Superior
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico
Neste trabalho propomos dois modelos para a geraÃÃo de fraturas em substratos regulares. No primeiro modelo, empregamos iterativamente o conceito de caminho crÃtico para determinar sistematicamente o elemento de menor âcondutividadeâ da rede. Estes elementos sÃo entÃo identificados como âfalhasâ e removidos permanentemente da estrutura atà que uma fratura macroscÃpica destrua a conectividade global da rede. Uma vez detectada, esta fratura à caracterizada topologicamente como uma estrutura auto-similar de dimensÃo fractal Dp ≈ 1.21. No segundo modelo, empregamos iterativamente o algoritmo de Dijkstra para determinar o caminho mÃnimo em uma paisagem aleatÃria, retirando sistematicamente desta estrutura o elemento de maior energia. Como no modelo anterior, estes elementos sÃo identificados como âfalhasâ atà que um conjunto conecto deles resulte em uma fratura macroscÃpica. A mÃdia realizada sobre vÃrias amostras de fraturas em diferentes tamanhos de substratos revela a presenÃa de uma estrutura auto-similar de dimensÃo fractal Df ≈ 1.21. A semelhanÃa numÃrica entre os expoentes Dp e Df sugere que os dois modelos pertencem à mesma classe de universalidade.
In this work we propose two models for fracture generation in regular substrates. In the first model, we iteratively apply the concept of critical path to systematically determine the lower âconductivityâ element in the connected spanning network. At each iteration, once these elements are identified as local âcracks ́ ́, they are permanently removed from the structure up to the point in which a macroscopic fracture can destroy the global network connectivity. This fracture is then topologically characterized as self-similar with fractal dimension Dp ≈ 1.21. In the second model, we employ the algorithm of Dijkstra to determine the minimal path in a random energy landscape and remove its highest energy element. As in the previous model, these elements are considered to be local âcracks ́ ́ till a subset of them can be identified as a macroscopic fracture. The average over many samples of fractures calculated for different system sizes reveals the presence of a self-similar structure with fractal dimension Df ≈ 1.21. The resemblance between the two exponents Dp e Df suggests that the two models belong to the same universality class.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Rajnoha, Martin. « Modelování skladů pomocí grafického rozhraní ». Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2016. http://www.nusl.cz/ntk/nusl-242015.

Texte intégral
Résumé :
Master’s thesis proposes a new algorithm which enables efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any places in warehouse based on Breadth first search, image processing „skeletonization“ and Dijkstra algorithm. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is less then milisecond using routing table and even size of warehouse doesn’t affect it significantly instead of using Dijkstra algorithm.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Johansson, David. « An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks ». Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17491.

Texte intégral
Résumé :

This thesis examines some of the best known algorithms for solving the shortest point-to-point path problem, and evaluates their performance on real metropolitan area networks. The focus has mainly been on Dijkstra‟s algorithm and different variations of it, and the algorithms have been implemented in C# for the practical tests. The size of the networks used in this study varied between 358 and 2464 nodes, and both running time and representative operation counts were measured.

The results show that many different factors besides the network size affect the running time of an algorithm, such as arc-to-node ratio, path length and network structure. The queue implementation of Dijkstra‟s algorithm showed the worst performance and suffered heavily when the problem size increased. Two techniques for increasing the performance were examined: optimizing the management of labelled nodes and reducing the search space. A bidirectional Dijkstra‟s algorithm using a binary heap to store temporarily labelled nodes combines both of these techniques, and it was the algorithm that performed best of all the tested algorithms in the practical tests.

This project was initiated by Netadmin Systems i Sverige AB who needed a new path finding module for their network management system NETadmin. While this study is primarily of interest for researchers dealing with path finding problems in computer networks, it may also be useful in evaluations of path finding algorithms for road networks since the two networks share some common characteristics.

Styles APA, Harvard, Vancouver, ISO, etc.
5

Silva, Inara Soldera Romano da [UNESP]. « Utilização de um algoritmo de caminho mínimo no processo de recolhimento do palhiço da cana-de-açúcar ». Universidade Estadual Paulista (UNESP), 2009. http://hdl.handle.net/11449/90600.

Texte intégral
Résumé :
Made available in DSpace on 2014-06-11T19:24:42Z (GMT). No. of bitstreams: 0 Previous issue date: 2009-12-16Bitstream added on 2014-06-13T19:52:21Z : No. of bitstreams: 1 silva_isr_me_botfca.pdf: 1100428 bytes, checksum: 826dc0fb9625c7e450be2699f43ec0bd (MD5)
A atual preocupação com o meio ambiente tem feito com que empresas produtoras de cana-de-açúcar invistam na mudança do sistema de colheita. Essa mudança consiste na redução da queima do canavial na pré-colheita e na utilização do corte mecanizado com cana crua. Porém, a colheita com corte mecanizado torna disponível a biomassa residual e sem as queimadas e com o maior acúmulo do palhiço sobre o solo, criamse condições favoráveis para o aparecimento de parasitas e atraso da brota da cana, comprometendo a próxima safra. Vários autores mostram a viabilidade do uso do palhiço na produção de energia. Pois, além do potencial energético desta biomassa, têm-se como vantagens as questões ambientais, a manutenção de empregos e a substituição dos recursos energéticos de fontes naturais. Mas, as grandes dificuldades ainda encontradas para aproveitamento desse resíduo para geração de energia são o grande número de maquinário envolvido no sistema de coleta deste resíduo e o alto custo que este processo demanda, principalmente o custo com transporte. O presente trabalho tem como objetivo propor aplicações de técnicas matemáticas de otimização para auxiliar o planejamento do recolhimento do palhiço da cana-de-açúcar para aproveitamento na geração de energia, estudando a melhor forma de carregamento dos fardos de palhiço, facilitando o transporte, diminuindo custos e desgastes de maquinários. Para isto, é sugerido o uso de técnicas de agricultura de precisão para mapear o palhiço enfardado, desta forma pode-se definir uma rota para recolher os fardos no campo e transportá-los para o centro de processamento. Para determinação da rota, propõe-se o uso do algoritmo de menor caminho da teoria de grafos, utilizando uma variação do algoritmo de Dijkstra.
The current concern with the environment has made sugar cane growers invest in changing their harvesting system. This change consists of the reduced burning of cane fields before harvesting and the use of mechanized cutting for raw canes. However, mechanized harvesting makes residual biomass available and, without the burning, the major accumulation of crop residue on the ground, creating favorable conditions for the emergence of parasites and delay of new shoots, affecting the next crop. Several authors show the feasibility of using crop residue for energy production. Besides the energy potential of the biomass, there are advantages for the environmental issues, preservation of jobs and the replacement of energy resources from natural sources. But the great difficulties still found in using this residue for power generation are the large number of machinery involved in the collection system of the waste and the high costs of this process, mainly transport costs. This paper aims to propose applications of mathematical optimization techniques to help plan the collection of sugar cane crop residue to be used for power generation, by studying the best way of loading bales of crop residue, making it easy to transport them, therefore reducing costs and wear on machinery. For this, we suggested the use of techniques of Precision Agriculture to map the baled crop residue, which allows you to define a route to pick up the bales in the field and transport them to the processing center. To determine the route, it is proposed to use the shortest path algorithm from graph theory, using a variation of Dijkstra's algorithm.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Stráník, František. « Teorie grafů - implementace vybraných problémů ». Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218082.

Texte intégral
Résumé :
This work is intended on identification with basic problems from the graphs theory area. There are the basic conceptions as well more complicated problems described. The one part of this work is specialized in working of individual types of graphs. It starts with single linked list through double linked list after as much as trees which represented the simplest graphs textures. The other part of this work devotes to the whole graph and describes more complicated problems and their resolution from the theory graphs area. Among these problems belongs to searching in graphs help by Depth First Search and Breadth First Search methods. Then searching the shortest way help by the specific algorithms as are: Dijkstra´s algorithm, Floyd-Warshall´s algorithm and Bellman-Ford´s algorithm. The last part is devoted to problems with searching minimal frames of graphs with usage Kruskal´s algorithm, Jarnik´s algorithm and Boruvka´s algorithm methods.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Yarmolskyy, Oleksandr. « Využití distribuovaných a stochastických algoritmů v síti ». Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2018. http://www.nusl.cz/ntk/nusl-370918.

Texte intégral
Résumé :
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Jágr, Petr. « Využití prostředků umělé inteligence pro podporu rozhodování v podniku ». Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2012. http://www.nusl.cz/ntk/nusl-223632.

Texte intégral
Résumé :
The master’s thesis deals with the use of artificial intelligence as support for managerial decision making in the company. This thesis contains the application which utilize genetic and graph algorithms to optimize the location of production facilities and logistic warehouses according to transport cost aspects.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Carli, Daniel Michelon de. « GERAÇÃO PROCEDURAL DE CENÁRIOS 3D DE CÂNIONS COM FOCO EM JOGOS DIGITAIS ». Universidade Federal de Santa Maria, 2012. http://repositorio.ufsm.br/handle/1/5394.

Texte intégral
Résumé :
This Master s thesis proposes a non-assisted procedural method for 3D canyons scenes generation based on techniques of computer graphics, computer vision and graph search algorithm. In order to define all the features to be reproduced in our scenes, we have analyzed several images of real canyons and have categorized them in two canyon features models: a recursive and an ordinary one. The proposed approach manipulates a heightmap, created using Perlin noise, in order to imitate the geological features formation previously analyzed. Several parametrizations are used to guide and constraint the generation of terrains, canyons features, course of river, plain areas, soft slope regions, cliffs and plateaus. This work also uses the Mean Shift algorithm as mechanism of segmentation to define regions of interest. A binary mask, with plain areas, is defined based on a threshold operation by a given data set provided by the Mean Shift algorithm. Thereafter a connected-component labeling algorithm is executed using the previously binary mask. This algorithm finds all plains centroids. Right after that, the Dijkstra s algorithm is performed in order to connect all plain areas, creating a valid path between the centroids. The Dijkstra s algorithm is executed again to define the river s course. Finally, a Gaussian smoothing operation is applied to interpolate the soft slope regions. The combination of all those techniques produces as a result automatically generated feature-rich canyons.
Esta dissertação propõe um método procedural não assistido, baseado em técnicas de computação gráfica, visão computacional e busca em grafos, para a geração de cenários 3D de cânions com foco em jogos digitais. Para definir as características a serem reproduzidas, foram analisadas diversas imagens de cânions reais chegando-se em dois modelos, um comum e outro recursivo. A abordagem proposta manipula um reticulado gerado com ruído de Perlin, moldando assim as características inerentes a essa formação geológica. São levadas em conta as diversas parametrizações necessárias para permitir que o algoritmo construa cânions com curso de rio, áreas de planícies, regiões de encosta suave, estruturas de penhascos e, por fim, planaltos nas regiões mais altas. Para atingir o resultado final, o trabalho utiliza o algoritmo Mean Shift como mecanismo de segmentação, definindo dados e regiões de interesse. Munido dos dados do algoritmo de clusterizacao, é definido um limiar para a criação de uma máscara binária com a definição das planícies. Em um segundo momento, um algoritmo de rotulação de componentes conectados é executado, extraindo-se os centróides de cada planície. Por sua vez, o algoritmo de Dijkstra encaixa-se na definição de rotas que conectam estas planícies. O algoritmo de Dijkstra é, então, executado novamente, tendo por base uma função de custo de inclinação, para definir o curso do rio. Por fim, uma filtragem espacial baseada em um filtro Gaussiano é aplicada para interpolar as regiões de encostas de declive suave. A combinação dessas técnicas gera terrenos com grande variabilidade e com as características inerentes à formação geológica de cânions.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Mináč, Ján. « Systém navigace pomocí GPS pro účely cementárenské technologie ». Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-217779.

Texte intégral
Résumé :
This diploma work deals with proposal and implementation GPS navigation system. Work includes described basic types of cement quarry and proposal to create mathematical and software model of quarry. Then work is devoted to possibilities of basic described algorithms for searching the shortest way in graph and two algorithms are described. They are Floyd-Warshall and Dikjstra algorithms. The work describe implementation of Dijkstra algorithm to model of quarry and description of the programs Autec RouteEditor and AQL Control Library. MINÁČ, J. GPS navifgation system for cement for cement technology. Brno: Brno university of technology, Faculty of electrical engineering and communication, 2009. 90 p. Supervisor prof. Ing. František Zezulka, CSc.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "Algorithm of Dijkstra"

1

Anand, Sachin. Graph theory and algorithms:implementation of Dijkstra's shortest path algorithm in Java. Oxford : Oxford Brookes University, 2001.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Newman, Mark. Computer algorithms. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198805090.003.0008.

Texte intégral
Résumé :
This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Algorithm of Dijkstra"

1

Çakır, Esra, et Ziya Ulukan. « Bipolar Neutrosophic Fuzzy Dijkstra Algorithm and Its Application ». Dans Advances in Intelligent Systems and Computing, 311–18. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51156-2_37.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Hong, Dai. « Medical Image Segmentation Based on Accelerated Dijkstra Algorithm ». Dans Advances in Intelligent Systems, 341–48. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27869-3_45.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Mohan, Anshuman, Wei Xiang Leow et Aquinas Hobor. « Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms ». Dans Computer Aided Verification, 801–26. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_37.

Texte intégral
Résumé :
AbstractWe develop machine-checked verifications of the full functional correctness of C implementations of the eponymous graph algorithms of Dijkstra, Kruskal, and Prim. We extend Wang et al.’s CertiGraph platform to reason about labels on edges, undirected graphs, and common spatial representations of edge-labeled graphs such as adjacency matrices and edge lists. We certify binary heaps, including Floyd’s bottom-up heap construction, heapsort, and increase/decrease priority.Our verifications uncover subtle overflows implicit in standard textbook code, including a nontrivial bound on edge weights necessary to execute Dijkstra’s algorithm; we show that the intuitive guess fails and provide a workable refinement. We observe that the common notion that Prim’s algorithm requires a connected graph is wrong: we verify that a standard textbook implementation of Prim’s algorithm can compute minimum spanning forests without finding components first. Our verification of Kruskal’s algorithm reasons about two graphs simultaneously: the undirected graph undergoing MSF construction, and the directed graph representing the forest inside union-find. Our binary heap verification exposes precise bounds for the heap to operate correctly, avoids a subtle overflow error, and shows how to recycle keys to avoid overflow.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Shen, Huiyan. « Research on Intelligent Traffic Scheduling Based on Dijkstra Algorithm ». Dans Advances in Intelligent Systems and Computing, 647–51. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98776-7_73.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Wang, Shiming, Jianping Xing, Yong Wu, Yubing Wu, Wei Xu, Xiangzhan Meng et Liang Gao. « Double-Sources Dijkstra Algorithm within Typical Urban Road Networks ». Dans Advances in Computer Science and Education, 155–61. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27945-4_24.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Uchida, Kazunori, et Leonard Barolli. « Line of Sight Procedure for Dijkstra-Algorithm Based Ray-Tracing ». Dans Advances on Broad-Band Wireless Computing, Communication and Applications, 741–53. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69811-3_66.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Sun, Yinchu, Xingwei Wang, Fuliang Li et Min Huang. « A Dijkstra Algorithm Based Multi-layer Satellite Network Routing Mechanism ». Dans Lecture Notes in Computer Science, 586–97. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22053-6_61.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Ngo, Truong-Giang, Thi-Kien Dao, Jothiswaran Thandapani, Trong-The Nguyen, Duc-Tinh Pham et Van-Dinh Vu. « Analysis Urban Traffic Vehicle Routing Based on Dijkstra Algorithm Optimization ». Dans Communication and Intelligent Systems, 69–79. Singapore : Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-1089-9_7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

JinJing, Zhao, Ling Pang, Xiaohui Kuang et Rong Jin. « Balancing the QOS and Security in Dijkstra Algorithm by SDN Technology ». Dans Lecture Notes in Computer Science, 126–31. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05677-3_11.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Yi, YunLong, et Ying Guan. « A Path Planning Method to Robot Soccer Based on Dijkstra Algorithm ». Dans Advances in Intelligent and Soft Computing, 89–95. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28658-2_14.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Algorithm of Dijkstra"

1

Parra, Octavio J. Salcedo, Gustavo Lopez Rubio et Lilia Castellanos. « Dijkstra Algorithm Based Reliability Model ». Dans 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications (DS-RT). IEEE, 2012. http://dx.doi.org/10.1109/ds-rt.2012.31.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Bogdan, Popa. « Dijkstra algorithm in parallel- Case study ». Dans 2015 16th International Carpathian Control Conference (ICCC). IEEE, 2015. http://dx.doi.org/10.1109/carpathiancc.2015.7145044.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Uchida, Kazunori, Shinsuke Nogami, Masafumi Takematsu et Junichi Honda. « Tsunami Simulation Based on Dijkstra Algorithm ». Dans 2014 17th International Conference on Network-Based Information Systems (NBiS). IEEE, 2014. http://dx.doi.org/10.1109/nbis.2014.105.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

SUN, Yan-Jiang, Xiang-Qian DING et Lei-Na JIANG. « Heuristic Pathfinding Algorithm Based on Dijkstra ». Dans 3rd Annual International Conference on Electronics, Electrical Engineering and Information Science (EEEIS 2017). Paris, France : Atlantis Press, 2017. http://dx.doi.org/10.2991/eeeis-17.2017.59.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Huang, Yizhen, Qingming Yi et Min Shi. « An Improved Dijkstra Shortest Path Algorithm ». Dans 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013). Paris, France : Atlantis Press, 2013. http://dx.doi.org/10.2991/iccsee.2013.59.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Zhang, Dong, ZuKuan Wei, Jae-Hong Kim et ShuGuang Tang. « An optimized Dijkstra algorithm for Embedded-GIS ». Dans 2010 International Conference on Computer Design and Applications (ICCDA 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccda.2010.5541160.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Parra, Octavio J. Salcedo, Gustavo Lopez Rubio et Brayan S. Reyes Daza. « Dijkstra algorithm based on a reliability model ». Dans 2014 International Conference on Information Society (i-Society). IEEE, 2014. http://dx.doi.org/10.1109/i-society.2014.7009008.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Irfan, Taufik, Rifqy Hakimi, Aris C. Risdianto et Eueung Mulyana. « ONOS Intent Path Forwarding using Dijkstra Algorithm ». Dans 2019 International Conference on Electrical Engineering and Informatics (ICEEI). IEEE, 2019. http://dx.doi.org/10.1109/iceei47359.2019.8988853.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Li, Yuqiang, et Qianxing Xiong. « Dijkstra Algorithm Implementing Services Composing Way Selection ». Dans 2010 2nd International Workshop on Intelligent Systems and Applications (ISA). IEEE, 2010. http://dx.doi.org/10.1109/iwisa.2010.5473556.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Makariye, Neha. « Towards shortest path computation using Dijkstra algorithm ». Dans 2017 International Conference on IoT and Application (ICIOT). IEEE, 2017. http://dx.doi.org/10.1109/iciota.2017.8073641.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Algorithm of Dijkstra » pour d’autres types de sources :
Articles de revues Thèses
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie