Search Results - (( java implementation path algorithm ) OR ( based design process algorithm ))

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

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

“…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
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

Genetic algorithm based for optimizing filter design / Rohana Awang Ahmed by Awang Ahmed, Rohana

“…Filter design is usually a long and complicated process. …”
Get full text
Get full text

Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

“…A custom Graph Processing Unit (GPU), in which a hardware priority queue accelerator is embedded, designed and prototyped in a Field Programmable Gate Array (FPGA) based hardware platform. …”
Get full text
Get full text
Get full text

Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri by Mohd Sabri, Norlina

“…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
Get full text
Get full text

Fast decryption method for a Rabin primitive-based cryptosystem by Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal

“…Hence faster decryption algorithms are sought-after. In this paper we design a fast and efficient algorithm for the decryption of the new cryptosystem based on the Rabin primitive. …”
Get full text
Get full text
Get full text

Developing triad design algorithms based on compatible factorization by Ibrahim, Haslinda, Omar, Zurni, Abdul Rahim, Rahela

Get full text
Get full text
Get full text

Edge Detection Algorithm For Image Processing Of Search And Rescue Robot by A/L Sivem, Prasanthran

“…Hence, a detailed flowchart of the working procedures of the project based on Canny edge detection algorithm is designed. …”
Get full text
Get full text

Real time monitoring and controlling using Petri net algorithm for batch process plant / Mohamad Shaiful Osman by Osman, Mohamad Shaiful

“…This thesis has presented a framework for designing and implementing a Petri net based supervisory for online control systems with the human in the loop, that mean human as a operator to switch the operation or monitoring the process flow. …”
Get full text
Get full text

E4ML: Educational Tool for Machine Learning by Sainin, Mohd Shamrie, Siraj, Fadzilah

“…There are various types of machine learning algorithms with certain processes taken by the algorithm.In teaching of the machine learning algorithms, such processes need to be explained especially to the beginner in introductory level.This paper discusses the development the tool that addresses the process by certain algorithm to produce a hypothesis or output based on given data.This tool can also be used in teaching and learning purposes.The explanation of processes by the algorithms is demonstrated through simple simulation.The source of the algorithms was adapted from Mitchell book [1] that cover popular algorithms in machine learning for teaching and learning such as Concept Learning, Decision Tree, Bayesian Learning, Neural Networks, and Instance based Learning.The tool also used several classes of Weka (Waikato Environment for Knowledge Analysis) as a basis for the design and implementation of the new tool that focuses on explaining the processes taken by certain algorithm.…”
Get full text
Get full text

A constructive task mapping algorithm for hard real-time embedded NoCs by M. Norazizi Sham Mohd Sayuti, Indrusiak L.S.

Subjects:

Benchmarking routing algorithms in NoC-based MPSoCs using guaranteed convergence arithmetic optimization with artificial neural networks and fuzzy MCDM by R Muhsin, Al-Molla Yousif

“…The effectiveness of communication within NoCs relies heavily on the routing algorithm employed. However, the routing process faces significant challenges, such as deadlock, livelock, congestion, and faults, which impact the Design Space Exploration process. …”
Get full text
Get full text
Get full text

Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

“…A typical component in QPU is a quantum device that runs quantum algorithms; namely Quantum Algorithm Processing Unit (QAPU). …”
Get full text
Get full text

Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

“…This project is designed based on speed optimization. DNA fragment assembly is a process reassembling fragment of DNA like a puzzle into several other sequence. …”
Get full text
Get full text

Design of a flexible digital baseband signal processing algorithm by Mohamad, Rosalina, Harun, Harlisya, Nuzli, Mohamad Anas, Dimyati, Kaharudin

“…The work presented in this paper is aimed at designing a flexible digital baseband signal processing algorithm (DBSP) for satellite applications. …”
Get full text
Get full text

Designing substitution boxes based on chaotic map and globalized firefly algorithm by Ahmed, Hussam Alddin Shihab

“…In this context, the proposed algorithm utilizes a new design for retrieving strong S- boxes based on standard firefly algorithm (SFA). …”
Get full text
Get full text

Efficient usage strategy of limited shared memory in Graphical Processing Unit (GPU) for accelerate DNA sequence alignment / Ahmad Hasif Azman by Azman, Ahmad Hasif

“…Moreover, the execution time proves that the design is able to speed up the computational process by about 90% compared to the Central Processing Unit (CPU). …”
Get full text
Get full text