Search Results - (( simulation realization path algorithm ) OR ( problem implementation using algorithm ))

Nonlinear FXLMS algorithm for active noise control systems with saturation nonlinearity by Sahib, Mouayad A., Raja Ahmad, Raja Mohd Kamil, Marhaban, Mohammad Hamiruce

“…Furthermore, the modeling of the THF can be realized using least mean square (LMS) algorithm and utilized in the NLFXLMS control scheme. …”
Get full text
Get full text
Get full text

Optimization algorithms for multipath transfer over asymmetric paths using concurrent multipath transfer stream control transmission protocol by Abass, Abdulridha Hanash

Get full text
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

Implementation of motion planning and active force control to a virtual wheeled mobile robot by Tang, Howe Hing

“…The motion path planning is based on the A*heuristic search algorithm with a specific reference to the sixelementary jumps graph for the generation of a nonholonomic global collision-free path environment. …”
Get full text
Get full text

Development of a State-Space Observer for Active Noise Control Systems by Muhssin, Mazin T.

“…This observer is employed to observe and monitor the pressure modes along the propagation path through simulating it in an offline structure i.e. without controller, or to observe the modes at the cancellation path through simulating the SSLMS in an on-line structure i.e. while the controller is converging. …”
Get full text
Get full text

Intelligent guidance parking system using modified Dijkstra's algorithm by Jaafar, Haslina, Zabidi, Muhamad Hidayat, Che Soh, Azura, Thong, Peng Hoong, Shafie, Suhaidi, Ahmad, Siti Anom

“…This paper presents the intelligent parking system which apply Dijkstra’s algorithm in finding the shortest path. The proposed intelligent parking guidance system is a system that assigns the nearest vacant bay to drivers with necessary direction printed on the ticket so that drivers are able to find the 'best' lot with the minimum amount of time. …”
Get full text
Get full text
Get full text

Probabilistic evaluation of wind power generation by Razali N.M.M., Misbah M.

“…For planning and decision making purposes, understanding and evaluation of the behaviour and distribution of WTG's output power are crucial. Monte Carlo simulation enables the realization of artificial futures by generating a huge number of sample paths of outcomes to perform this analysis. …”

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

“…The focus of this study is developing a framework of QAPU and hybrid architecture for classical-quantum algorithms. The framework is used to increase the implementation performance of quantum algorithms. …”
Get full text
Get full text

The enhanced fault-tolerant AODV routing protocol for Wireless Sensor Network by Che-Aron, Zamree, Mohammed Al-Khateeb, Wajdi Fawzi, Anwar, Farhat

“…We design and implement a backup route algorithm by creating a backup path for every node in the network. …”
Get full text
Get full text
Get full text

Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

“…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
Get full text
Get full text

Festive season balancing groceries optimization / Fairuz Mohamed Razi by Mohamed Razi, Fairuz

“…This research uses Genetic Algorithms concept and technique to solve an optimization problem in shortage in supply-demand during festive season which is during Hari Raya Aidilfitri. …”
Get full text
Get full text

The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

“…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
Get full text
Get full text

Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

“…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
Get full text
Get full text

Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

“…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
Get full text
Get full text

Metric's thresholds for encoding evolutionary computing representation in software engineering problem by Md Sultan, Abu Bakar, Din, Jamilah, Zulzalil, Hazura, Bakar, Abubakar Diwani

“…The software metrics selection problem is among the problems implemented using this technique. …”
Get full text
Get full text
Get full text

An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text

A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
Get full text

Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
Get full text
Get full text

Optimal path planning algorithm for swarm robots using bat algorithm with mutation (bam) by Lim, Pei Yee

“…However, there is still room for improvement such as implementing the obstacle avoidance algorithm into swarm robot. …”
Get full text
Get full text

Faculty timetabling using genetic algorithm by Liong, Boon Yaun

“…Faculty Timetabling using Genetic Algorithm (FTGA) is an application that generate optimum timetable for faculty.The target user of this application is faculty staff who responsible in generate timetable.The problem statement of the project is many clashing exist in the timetable.Faculty staff needs to solve the clashing manually.This will waste time and it is a problem for staff to solve the clashing.By implement GA,clashing will be reduced.The objective of the project is to develop aprototype in scheduling application for generates an optimum timetable for a faculty.Genetic algorithm will be implemented.The scope of FTGA is Faculty of Computer Systems & Software Engineering (FCSSE).The methodology use in this project is prototype model.The testing result show 95 out of 100 test cases achieved the maximum fitness value which means there is no clashing in the timetable.The maximum generation is set to 15 generation.Population for each generation is 3 populations.Percentage of FTGA solve the problem is 95%.…”
Get full text
Get full text