Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

39 results for “shortest path algorithm”
Set a search alert
Research ArticleOpen accessIn the keywordsA Successive Admissible Cell Method for Solving Large Scale Linear Assignment Problem with Dense Cost MatrixWarut Boonphakdee, Peerayuth CharnsethikulNormally, the Linear Assignment Problem (LAP) has been solved by successful algorithms such as Lapjv and Munkres programmed as MATLAB codes. This study presented an improved algorithm for solving large scale LAP. A preprocessing (PP) algorithm was proposed to apply for constructing the kth transferred reduced cost matrix then this matrix was solved by Lapjvalgorithm. Performances of PP-Lapjvalgorithm were faster … …Journal of Computer Science, Vol. 12, Issue 8 · 16 Nov 2016 · 6,948 accessesView PDFCite
Research ArticleOpen accessIn the abstractBased Approach to Improve the All-Pair Shortest Path ComputationLau Nguyen Dinh, Le Thanh TuanThis paper presents the development of a centralized algorithm for finding the shortest path between all pairs of vertices on a graph, utilizing the basic structure of the Floyd-Warshall sequential algorithm. The proposed algorithm leverages multiple processors to compute the shortest path between all vertex pairs, with one processor taking the central role in data management. This central processor divides … …Journal of Computer Science, Vol. 21, Issue 7 · 30 Jun 2025 · 2,903 accessesView PDFCite
Research ArticleOpen accessIn the abstractCOV19-Dijkstra: A COVID-19 Propagation Model Based on Dijkstra’s AlgorithmArnaud Watusadisi Mavakala, Wilfried Yves Hamilton Adoni, Najib Ben Aoun et al.The presence of the coronavirus, known as COVID-19, has prompted several researchers to study the mode of spread and the different defense mechanisms of the virus. As a reminder, obtaining a vaccine, for which much research is being conducted around the world, is a long and expensive process and it is unlikely that the pandemic can be treated in time. … …Journal of Computer Science, Vol. 19, Issue 1 · 5 Jan 2023 · 6,606 accessesView PDFCite
Research ArticleOpen accessIn the abstractEstablishing an Evacuation Network: A Path Ranking ApproachHoussein Alaeddine, Kamal Serrhini, Mindjid Maizia, Emmanuel NéronThe evacuation of population exposed to flood hazard requires the establishment of a specific transportation network. This is to compute escape routes to be taken by affected population. At evacuation time, inhabitants of affected area must be evacuated through transportation network to safety area. The main objective of this work is to provide assistance to rescue forces in terms of … …Journal of Computer Science, Vol. 15, Issue 12 · 3 Dec 2019 · 7,899 accessesView PDFCite
Research ArticleOpen accessIn the abstractCognitively Inspired Algorithm for Imprecise NavigationMelissa Shahrom, Zalilah Abd AzizThis paper presents an algorithm, namely the private navigation algorithm. The aim of this algorithm is to bridge the gap between high quality navigation services and low quality of location information or imprecise data. Generally, the imprecision is due to the poor positioning technology and the algorithms use to protect location privacy. The benefits of the algorithm are at least … …Journal of Computer Science, Vol. 12, Issue 6 · 14 Jul 2016 · 7,097 accessesView PDFCite
Research ArticleOpen accessIn the abstractMaximally Distant Codes Allocation Using Chemical Reaction Optimization and Ant Colony Optimization AlgorithmsTaisir Eldos, Waleed Nazih, Aws KananError correcting codes, also known as error controlling codes, are set of codes with redundancy that allows detecting errors. This is quite useful in transmitting data over a noisy channel or when retrieving data from a storage with possible physical defects. The idea is to use a set of code words that are maximally distant from each other, hence reducing … …Journal of Computer Science, Vol. 11, Issue 8 · 5 Nov 2015 · 7,000 accessesView PDFCite
Research ArticleOpen accessIn the abstractModeling of a Dynamic Interaction of Motor Transport and Natural Systems in Order to Minimize the Risks of Project and Management DecisionsL. G. Gagarina, D. N. Kavtaradze, A. A. Mordovin et al.Fundamental tasks for the problem of scientific support for the design of transport infrastructure in the ecosystem splits are analyzed. New aspects of simulational application in dynamic interaction of motor transport and natural systems are considered. Method for simulational studies is analyzed. The problems and advantages of the simulation of complex systems are investigated. Mathematical model of the transport infrastructure … …Journal of Computer Science, Vol. 11, Issue 2 · 2 Oct 2014 · 7,174 accessesView PDFCite
Research ArticleOpen accessIn the abstractDEVELOPMENT OF OBSTACLE AVOIDANCE TECHNIQUE IN WEB-BASED GEOGRAPHIC INFORMATION SYSTEM FOR TRAFFIC MANAGEMENT USING OPEN SOURCE SOFTWARENik Mohd Ramli Nik Yusoff, Helmi Zulhaidi Mohd Shafri, Ratnasamy Muniandy, Islam Mohammad WaliThe shortest path routing is one of the well-known network analysis techniques implemented in road management systems. Pg Routing as an extension of Postgre SQL/Post GIS database is an open source library that implements the Dijkstra shortest path algorithm. However, the functionality to avoid obstacles in that analysis is still limited. Therefore, this study was conducted to enable obstacle avoidance … …Journal of Computer Science, Vol. 10, Issue 7 · 16 Jun 2014 · 6,931 accessesView PDFCite
Research ArticleOpen accessIn the abstractPERFORMANCE ANALYSIS OF RANDOMIZED REVERSE AD HOC ON DEMAND DISTANCE VECTOR ROUTING PROTOCOL IN MANETK. Santhi, B. ParvathavarthiniIn high mobility, routing in Mobile Ad-Hoc Network is a very difficult task. In AODV and RAODV, all the data packets are travel through the same shortest path so the intruders can easily trace out the data path. The main objective of Randomized RAODV provides the multipath and then the paths are selected randomly for security purposes. Using randomized routing … …Journal of Computer Science, Vol. 10, Issue 9 · 30 Apr 2014 · 6,809 accessesView PDFCite
Research ArticleOpen accessIn the abstractA PARTICLE SWARM OPTIMIZATION APPROACH FOR LOW POWER VERY LARGE SCALE INTEGRATION ROUTINGG. Nallathambi, S. RajaramThis study deals with the particle swarm optimization approach for optimal power dissipation in VLSI interconnect driven routing technique. Interconnect power dissipation is a major challenging research problem in Deep Submicron (DSM) regime that affects the overall circuit performance. The Buffer Insertion Buffer Sizing and Wire Sizing (BISWS) is considered for minimizing the power dissipation in VLSI circuits using interconnect … …Journal of Mathematics and Statistics, Vol. 10, Issue 1 · 1 Feb 2014 · 6,741 accessesView PDFCite