Results 21 to 30 of about 3,982 (139)

Research on the Modeling and Simulation of Optimal Dynamic Aerial Ammunition Scheduling and Transportation [PDF]

Xibei Gongye Daxue Xuebao, 2018
To optimize the aerial ammunition scheduling and transportation, both the synergy among all departments of aerial ammunition support system and uncertain factors, such as traffic and attack situations, are taken into consideration in the model.

doaj   +1 more source

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

A Graph-Based Reinforcement Learning Method with Converged State Exploration and Exploitation [PDF]

, 2019
In any classical value-based reinforcement learning method, an agent, despite of its continuous interactions with the environment, is yet unable to quickly generate a complete and independent description of the entire environment, leaving the learning ...
Chen, Tianding, Jiang, Yingtao, Li, Han, Teng, Hualiang   +3 more
core   +2 more sources

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

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

A threshold for majority in the context of aggregating partial order relations [PDF]

, 2010
We consider a voting problem where voters have expressed their preferences on a single set of objects. These preferences take the shape of strict partial order relations.
De Baets, Bernard, Rademaker, Michaël
core   +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

Three-Layer Energy Optimization Strategy for CHP Microgrid Considering Path Loss

Zhongguo dianli, 2023
In order to reduce the dependence of the microgrid on the external system and the operating cost of the microgrid itself, a three-layer energy optimization strategy is proposed for the combined heat and power microgrid cluster.
Kai LING, Can WANG, Gaorui ZHANG, Aoqi WANG, Sihu CHU, Fuyin TIAN, Xinran LI   +6 more
doaj   +1 more source

Blocked All-Pairs Shortest Paths Algorithm on Intel Xeon Phi KNL Processor: A Case Study

, 2018
Manycores are consolidating in HPC community as a way of improving performance while keeping power efficiency. Knights Landing is the recently released second generation of Intel Xeon Phi architecture.
A Nakaya, C Rosales, DE Culler, G Venkataraman, J Reinders, MB Giles, RW Floyd, S Jalali, S Warshall   +8 more
core   +1 more source