Search Results - (( simulation information needs algorithm ) OR ( java implementation path algorithm ))

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

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

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

Revisit of statistical selection algorithm for peer-to-peer system by Othman, Mohamed, Kweh, Yeah Lun

Get full text
Get full text

Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

Get full text
Get full text

Distance approximation using pivot point in narrow phase collision detection by Sulaiman, Hamzah Asyrani, Bade, Abdullah, Abdullah, Mohd Harun

Get full text
Get full text

PSAT : a pairwise test data generation tool based on simulated annealing algorithm by Goh, Ghee Hau

“…This research is about the research on developing a Pairwise Test Data Generation Tool based on Simulated Annealing (SA) algorithm which named as PSAT. …”
Get full text
Get full text

Resource management in grid computing using enhanced ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza, Abdul Nasir, Husna Jamal

“…Simulation approach has been used to test the performance of the algorithm. …”
Get full text
Get full text

Enhanced marking process (EMP) for constructing dominating set in mobile ad-hoc networks with unidirectional links by Waheed, Bassam M. S., Mohd Ali, Borhanuddin, Khatun, Sabira, Mohd Sidek, Roslina

“…Our enhanced algorithm features a good locality properties since it need only 2-hop neighborhood information within each node. …”
Get full text
Get full text
Get full text

Relationship based replication algorithm for data grid by Yusof, Yuhanis

“…The Relationship based Replication algorithm aims to improve the Data Grid performance by reducing the job execution time, bandwidth and storage usage.The RBR was realized using a network simulation (OptorSim) and experiment results revealed that it offers better performance than existing replication algorithms.…”
Get full text
Get full text

IoT data encryption algorithm for security by Kanaan Ismael, Marwan

Get full text
Get full text
Get full text
Get full text

Chaotic-based encryption algorithm using henon and logistic maps for fingerprint template protection by Siswanto, Apri, Katuk, Norliza, Ku-Mahamud, Ku Ruhana

“…A series of simulations were conducted using MATLAB to evaluate the performance of the proposed chaotic-based encryption algorithm for FTP through different analyses covering key sensitivity, histogram, correlations, differential, information entropy, and encryption/decryption speed. …”
Get full text
Get full text
Get full text

Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid by Lorpunmanee, Siriluck, Md Sap, Mohd Noor, Abdullah, Abdul Hanan

“…In the experiments, we used the workload historical information and put it into our simulator. We get the better result when compared to the traditional algorithms for scheduling policies. …”
Get full text
Get full text

An efficient innovative method to decrease routing table size in packet switched networks by Baygi, Maassoumeh Javadi, Ramli, Abdul Rahman, Zaeri, Bahram, Mohd Ali, Borhanuddin

“…The resulting algorithm, the ‘‘D-T-SAntNet,’’ is then simulated via Omnet++ onUUNET network topology. …”
Get full text
Get full text
Get full text

Flood Control Distance Vector Hop (FCDV-Hop) localization in wireless sensor networks by Zazali, Azyyati Adiah, Subramaniam, Shamala, Ahmad Zukarnain, Zuriati

“…The DV-Hop algorithm obtains the distance information from the unknown nodes to the anchor nodes through the network topology calculation rather than the radio wave signals measurement which are used in the range-based algorithm. …”
Get full text
Get full text
Get full text

HYBRID WATER CYCLE OPTIMIZATION ALGORITHM WITH SIMULATED ANNEALING FOR SPAM EMAIL DETECTION by GHADA HAMMAD AL-RAWASHDEH

“…The proposed method is based on the hybridization of Water Cycle Algorithm with the Simulated Annealing to optimize the results. …”
Get full text

Panoramic image matching method for uav remote sensing based on surf algorithm by Awisqarni Nah Wan

Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

Get full text
Get full text

Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

“…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text