نتایج جستجو برای: dijkstra algorithm

تعداد نتایج: 754376  

Journal: :JSW 2012
Xiaohui Liu Xiaohui Guo Xueyu Zhao

Based on the introduction of the concepts of logistics and logistics center, this paper analyzed the status and problems of Jilin Province’s logistics center, and proposed the steps, principles and factors for site selection of logistics center. Then by listing and comparing nine kinds of logistics center site selection method, including Analytic Hierarchy Process, Cluster Algorithm, Genetic Al...

2015
MILENA KAROVA DANISLAV ZHELYAZKOV MARIANA TODOROVA IVAYLO PENEV

The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...

Journal: :American Journal of Operations Research 2022

In this paper, the map of a network air routes was updated by removing non-optimal and replacing them with best ones. An integer linear programming model developed. The aim to find optimal in superspace based on performance-based navigation. were found from DIJKSTRA algorithm that calculates shortest path graph. Simulations python language real traffic areas showed improvements brought surface ...

Journal: :International Journal of Advances in Data and Information Systems 2021

The problem of finding the shortest path from a or graph has been quite widely discussed. There are also many algorithms that solution to this problem. purpose study is analyze Greedy, A-Star, and Dijkstra in process path. author wants compare effectiveness three graph. From results research conducted, can conclude be determining with different results. Greedy algorithm fast solutions but tends...

2009
John Crawford

Some multicast applications require high bandwidth and bounded delay eg Video conferencing The general problem of constructing bounded delay minimal cost mul ticast trees uses two link metrics cost and delay and is NP complete A number of heuristics have been developed most of which tend to have a high order of time com plexity Our heuristics achieve good results with low time complexity and we...

Journal: :Journal of Optical Communications and Networking 2019

Journal: :Jurnal Matematika UNAND 2017

Based on rapid upsurge in the demand and usage of electronic media devices such as tablets, smart phones, laptops, personal computers, etc. and its different display specifications including the size and shapes, image retargeting became one of the key components of communication technology and internet. The existing techniques in image resizing cannot save the most valuable information of image...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید