Search Results - (( simulation using random algorithm ) OR ( java implication based algorithm ))

A fault syndromes simulator for random access memories by Wan Hasan, Wan Zuha, Abdul Halim, Izhal, Mohd Sidek, Roslina, Othman, Masuri

“…At present, the March test algorithm is used to detect and diagnose all faults related to Random Access Memories. …”
Get full text
Get full text

Synchronous-asynchronous simulated kalman filter algorithm with random switching by Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Marizan, Mubin, Norrima, Mokhtar

Get full text
Get full text
Get full text

Self-similar network traffic using Successive Random Addition (SRA) algorithm / Hani Hamira Harun by Harun, Hani Hamira

“…In this project, we have used the Successive random algorithm (SRA). Then, we have decided to use Variance time plot and R/S statistics as our statistical analysis tools. …”
Get full text
Get full text

March-based diagnosis algorithm for static random-access memory stuck-at faults and transition faults by Mat Isa, Masnita

“…Results obtained from simulation validate the generated fault syndromes thus confirmed the ability of this algorithm to detect and distinguish between SAFs and TFs. …”
Get full text
Get full text

Hybrid optimization approach to estimate random demand by Wahab, Musa, Ku-Mahamud, Ku Ruhana, Yasin, Azman

“…The main objective of this study is to develop a demand forecasting model that should reflect the characteristics of random demand patterns.To accomplish this goal, a hybrid algorithm combining a genetic algorithm and a local search algorithm method was developed to overcome premature convergence in local optima problems.The performance of the hybrid algorithm was compared with a single algorithm model in estimating parameter values that minimize objective function which was used to measure the goodness-of-fit between the observed data and simulated results.However, two problems had to be overcome in the forecasting random demand model. …”
Get full text
Get full text
Get full text

Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network by Puteri Azwa, Ahmad

“…The EVFA approach can relocate the sensor nodes using a repulsive and attractive force after initial deployment and CS algorithm is more efficient in exploring the search of maximum coverage area in random deployment. …”
Get full text
Get full text
Get full text

Single-Solution Simulated Kalman Filter Algorithm for Global Optimisation Problems by Nor Hidayati, Abdul Aziz, Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Mohd Saberi, Mohamad, Watada, Junzo

“…The proposed ssSKF algorithm is tested using the 30 benchmark functions of CEC 2014, and its performance is compared to the original SKF algorithm, Black Hole (BH) algorithm, Particle Swarm Optimisation (PSO) algorithm, Grey Wolf Optimiser (GWO) algorithm, and Genetic Algorithm (GA). …”
Get full text
Get full text

An efficient fault syndromes simulator for SRAM memories by Wan Hasan, Wan Zuha, Abdul Halin, Izhal, Mohd Sidek, Roslina, Othman, Masuri

“…At present, March test algorithm is used to detect and diagnose all faults related to Random Access Memories. …”
Get full text
Get full text
Get full text

Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management by Julius, Beneoluchi Odili, M. N. M., Kahar, Noraziah, Ahmad, M., Zarina, Riaz, Ul Haq

“…After critical assessments of the performances of eleven algorithms consisting of two heuristics (Randomized Insertion Algorithm and the Honey Bee Mating Optimization for the Travelling Salesman’s Problem), two trajectory algorithms (Simulated Annealing and Evolutionary Simulated Annealing) and seven population-based optimization algorithms (Genetic Algorithm, Artificial Bee Colony, African Buffalo Optimization, Bat Algorithm, Particle Swarm Optimization, Ant Colony Optimization and Firefly Algorithm) in solving the 60 popular and complex benchmark symmetric Travelling Salesman’s optimization problems out of the total 118 as well as all the 18 asymmetric Travelling Salesman’s Problems test cases available in TSPLIB91. …”
Get full text
Get full text
Get full text

Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

“…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
Get full text
Get full text

Single-solution Simulated Kalman Filter algorithm for global optimisation problems by Abdul Aziz, N.H., Ibrahim, Z., Ab Aziz, N.A., Mohamad, M.S., Watada, J.

“…The proposed ssSKF algorithm is tested using the 30 benchmark functions of CEC 2014, and its performance is compared to that of the original SKF algorithm, Black Hole (BH) algorithm, Particle Swarm Optimisation (PSO) algorithm, Grey Wolf Optimiser (GWO) algorithm and Genetic Algorithm (GA). …”
Get full text
Get full text

Single-solution Simulated Kalman Filter algorithm for global optimisation problems by Abdul Aziz, N.H., Ibrahim, Z., Ab Aziz, N.A., Mohamad, M.S., Watada, J.

“…The proposed ssSKF algorithm is tested using the 30 benchmark functions of CEC 2014, and its performance is compared to that of the original SKF algorithm, Black Hole (BH) algorithm, Particle Swarm Optimisation (PSO) algorithm, Grey Wolf Optimiser (GWO) algorithm and Genetic Algorithm (GA). …”
Get full text
Get full text

New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems by Nor Shuhada, Ibrahim

“…All the methods and data analysis were carried out using MATLAB simulator. Generally, the average results indicates that the newly developed algorithm retrieved better than original MABSA in finding a minimum point which increment 5.833% better than original MABSA, and new algorithm retrieved 5.204% more better than global optimum value. …”
Get full text
Get full text

The impact of fuzzy discretization�s output on classification accuracy of random forest classifier by Fikri, M.N., Hassan, M.F., Tran, D.C.

“…Random Forest is known as among the widely used classification algorithms by researchers and machine learning enthusiast in solving classification problems. …”
Get full text
Get full text

Parameter-Less Simulated Kalman Filter by Nor Hidayati, Abdul Aziz, Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Saifudin, Razali

“…Simulated Kalman Filter (SKF) algorithm is a new population-based metaheuristic optimization algorithm. …”
Get full text
Get full text
Get full text

Predictive modeling of condominium prices using a Particle Swarm Optimization-Random Forest approach / Che Wan Sufia Che Wan Samsudin by Che Wan Samsudin, Che Wan Sufia

“…Essential phases of the project include data collection, data preprocessing, and the implementation of the Particle Swarm Optimization-Random Forest price prediction algorithm. Both simulated and real-world experiments are used as a basis to rigorously test and validate the predictive capability of the model. …”
Get full text
Get full text

An efficient backoff algorithm for IEEE 802.15.4 wireless sensor networks by Dahham, Zahraa, Sali, Aduwati, Mohd Ali, Borhanuddin

“…The contention access period of IEEE 802.15.4 employs carrier sense multiple access with collision avoidance (CSMA/CA) algorithm. A long random backoff time causes longer average delay, while a small one gives a high collision rate. …”
Get full text
Get full text

A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree by Yincong Ma, Kit Guan Lim, Min Keng Tan, Helen Sin Ee Chuo, Lorita Angeline, Kenneth Tze Kin Teo

“…The improved algorithm is used to obtain the rough obstacle avoidance of the vehicle. …”
Get full text
Get full text
Get full text
Get full text

GPS boundary navigation of DrosoBots using MATLAB simulation by Zainal Abidin, Zulkifli, Ngah , Vmi Kalthum, Arshad, Mohd Rizal, Kok , Chee Hou

Get full text
Get full text

A comparative analysis of task scheduling algorithms of virtual machines in cloud environment by Atiewi S., Yussof S., Ezanee M.

“…Based on the analysis of the simulation result, we can conclude which algorithm is the best for scheduling in terms of energy and performance of VMs. …”