Search Results - (( dynamic relocation optimization algorithm ) OR ( java implementation path algorithm ))

Adaptive emergency evacuation centre management for dynamic relocation of flood victims using firefly algorithm by Che Pa, Noraziah, Hashim, Nor Laily, Yusof, Yuhanis, Hussain, Azham

Get full text
Get full text
Get full text

The application of firefly algorithm in an adaptive emergency evacuation centre management (AEECM) for dynamic relocation of flood victims by Che Pa, Noraziah, Hashim, Nor Laily, Yusof, Yuhanis, Hussain, Azham

Get full text
Get full text
Get full text

Enhancing campus mobility: simulated multi-objective optimization of electric vehicle sharing systems within an intelligent transportation system frameworks by Aba Hussen, Omar S., Hashim, Shaiful J., Sulaiman Member, Nasri, Alhaddad, S.A.R., Ribbfors, Bassam Y., Umeda, Masanobu, Katamine, Keiichi

“…In addition to conventional decision variables, dynamic dual relocation thresholds and charge levels are introduced as decision variables to enhance optimization. …”
Get full text
Get full text
Get full text

Midrange exploration exploitation searching particle swarm optimization with HSV-template matching for crowded environment object tracking by Nurul Izzatie Husna, Muhamad Fauzi

“…In this algorithm, the worst particle will be relocating to a new position to ensure the concept of exploration and exploitation remains in the search space. …”
Get full text
Get full text

Optimising cloud computing performance with an enhanced dynamic load balancing algorithm for superior task allocation by Zhanuzak, Raiymbek, Ala'anzy, Mohammed Alaa, Othman, Mohamed, Algarni, Abdulmohsen

“…Unlike benchmark algorithms that rely on static VM selection or post-hoc relocation of cloudlets, the EDLB algorithm dynamically identifies optimal cloudlet placement in real-time. …”
Get full text
Get full text
Get full text

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

A wireless interference-aware internet-of-things gateway placement framework with genetic algorithm approach by Kong, Zan Wai

“…However, there is no existing gateway placement scheme that considers all the factors of number of gateways, sensor nodes coverage, lateral bound (inter-gateway) connections, redundancy for fault tolerance and dynamic changes of sensor nodes’ location. Therefore, this work proposes a framework to optimized gateway placement that considers all the aforementioned factors. …”
Get full text
Get full text

Automatic generic process migration system in linux by Zarrabi, Amirreza

“…A fexible interface to the underlying checkpoint/ restart subsystem is designed which permits users to specify the migration mechanism according to process constraints. A migration algorithm is designed which attempts to exploit the unique features of the basic migration algorithms to form a generic algorithm. …”
Get full text
Get full text

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text