Results 31 to 40 of about 5,019,245 (200)

Penerapan Algoritma Floyd Warshall Dalam Aplikasi Penentuan Rute Terpendek Mencari Lokasi BTS (Base Tower Station) Pada PT.GCI Palembang

Jurnal Teknologi dan Sistem Informasi, 2018
For PT.GCI Palembang optimization of the shortest route is needed in the process of finding the location of BTS (Base Tower Station) because with the optimization of the shortest route determination can assist the technician in optimizing the distance to
Vera Apriliani Nawagusti
doaj   +1 more source

Shortest Path Discovery in the Multi-layered Social Network [PDF]

, 2011
Multi-layered social networks consist of the fixed set of nodes linked by multiple connections. These connections may be derived from different types of user activities logged in the IT system.
Bródka, Piotr, Kazienko, Przemysław, Stawiak, Paweł   +2 more
core   +1 more source

A Performance Comparison of Shortest Path Algorithms in Directed Graphs

Engineering Proceedings
This study examines the performance characteristics of four commonly used short-path algorithms, including Dijkstra, Bellman–Ford, Floyd–Warshall, and Dantzig, on randomly generated directed graphs.
Fatima Sapundzhi, Kristiyan Danev, Antonina Ivanova, Metodi Popstoilov, Slavi Georgiev   +4 more
doaj   +1 more source

Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles

Journal of Telecommunications and Information Technology, 2018
The paper presents a new algorithm to determine the shortest, non-crossing, rectilinear paths in a twodimensional grid graph. The shortest paths are determined in a manner ensuring that they do not cross each other and bypass any obstacles present. Such
Shylashree Nagaraja
doaj   +1 more source

Theory Learning with Symmetry Breaking [PDF]

, 2017
This paper investigates the use of a Prolog coded SMT solver in tackling a well known constraints problem, namely packing a given set of consecutive squares into a given rectangle, and details the developments in the solver that this motivates.
Akgün O., Chu G., Gent I. P., Huang E., Korf R. E., Kroening D., Nethercote N.   +6 more
core   +1 more source

A Comparative Study of Single-Constraint Routing in Wireless Mesh Networks Using Different Dynamic Programming Algorithms

Journal of Engineering, 2023
Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming
Sabreen Mahmood Shukr, Nuha Abdul Sahib Alwan, Ibraheem Kassim Ibraheem   +2 more
doaj   +1 more source

Octagonal Domains for Continuous Constraints [PDF]

, 2011
International audienceDomains in Continuous Constraint Programming (CP) are generally represented with intervals whose $n$-ary Cartesian product (box) approximates the solution space.
Benhamou, Frédéric, Pelleau, Marie, Truchet, Charlotte   +2 more
core   +3 more sources

Improved Floyd-Warshall Algorithm for Solving Travelling Salesman Problem

Jagannath University Journal of Science
The shortest path problem is a fundamental challenge in graph theory, focused on identifying the most efficient routes between nodes in a network. It stands as one of the extensively researched combinatorial optimization problems.
Solima Khanam, Shourov Roy, Musfiqur Rahman Shihab   +2 more
semanticscholar   +1 more source

Modified Floyd Warshall Algorithm for Cache Management in Information Centric Network

International Journal of Intelligent Engineering and Systems, 2020
: Information Centric Network (ICN) is one of the growing network environments that provides the majority of internet activities, which are related to information access and delivery.
B. Kumar, E. Reddy
semanticscholar   +1 more source

Ndist2vec: Node with Landmark and New Distance to Vector Method for Predicting Shortest Path Distance along Road Networks

ISPRS International Journal of Geo-Information, 2022
The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd ...
Xu Chen, Shaohua Wang, Huilai Li, Fangzheng Lyu, Haojian Liang, Xueyan Zhang, Yang Zhong   +6 more
doaj   +1 more source