Search Results - (( basic localization based algorithm ) OR ( using simulation using algorithm ))

Optimization of the Time of Task Scheduling for Dual Manipulators using a Modified Electromagnetism-Like Algorithm and Genetic Algorithm by Abed I.A., Koh S.P., Sahari K.S.M., Jagadeesh P., Tiong S.K.

“…A method based on a modified electromagnetism-like with two-direction local search algorithm (MEMTDLS) and genetic algorithm (GA) is proposed to determine the optimal time of task scheduling for dual-robot manipulators. …”

Vision Based Calibration and Localization Technique for Video Sensor Networks by Mohamed Sharif, Sharif Amar Mohamed Sharif

“…Very few of these localization algorithms use vision based technique. …”
Get full text
Get full text

Design And Evaluation Of A Modified Csma/Cd Mac Protocol On Single-Channel Optical Local Area Network by Khairi, Kharina

“…The algorithm was developed in Visual Basic 6.0v programming language. …”
Get full text
Get full text

Simulation on Emotion Recognition for Autism Therapy by Adzmi, Muhammad Azrin

“…This paper mainly focusing on the simulation of emotion recognition software based on the Local Binary Pattern (LBP) algorithm to extract the features from the image. …”
Get full text
Get full text

Development of a new nonlinear filtering algorithm for impulse noise reduction by Ahmad, Mohd Ashraf

Get full text
Get full text

Parametric modelling of a TRMS using dynamic spread factor particle swarm optimisation by Toha, Siti Fauziah, Abd Latiff, I., Mohamad, M., Tokhi, M Osman

“…Thus, the usage of dynamic SF is proved experimentally to satisfy main issues of using basic PSO that are trapped in local optima and preservation of diversity. …”
Get full text
Get full text
Get full text

Nomadic people optimizer (NPO) for large-scale optimization problems by Mohamd Salih, Sinan Qahtan

“…The basic component of the algorithm consists of several clans and each clan searches for the best place (or best solution) based on the position of their leader. …”
Get full text
Get full text

Quality Of Service Provisioning Scheme For Real-Time Applications in IEEE 802.11 Wireless Local Area Network by Ng, Roger Cheng Yong

“…The SNT adapts contention parameters of individual ACs based on the network load in a basic service set (BSS). …”
Get full text
Get full text

A hybrid range-free algorithm using dynamic communication range for wireless sensor networks by Fengrong, Han, Izzeldin Ibrahim, Mohamed Abdelaziz, Xinni, Liu, Kamarul Hawari, Ghazali, Hao, Wang

“…Distance-Vector Hop (DV-Hop) is a representative range-free localization algorithm, which is widely utilized to locate node position in location-based application. …”
Get full text
Get full text
Get full text

Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems by Din, Fakhrud, Khalid, Shah, Fayaz, Muhammad, Gwak, Jeonghwan, Kamal Z., Zamli, Mashwani, Wali Khan

“…The performance of the fuzzy adaptive teaching learning-based optimization is evaluated against other metaheuristic algorithms including basic teaching learning-based optimization on 23 unconstrained global test functions. …”
Get full text
Get full text
Get full text

Enhanced convergence of Bat Algorithm based on dimensional and inertia weight factor by Ramli, Mohamad Raziff, Abal Abas, Zuraida, Desa, Mohammad Ishak, Zainal Abidin, Zaheera, Al Azzam, Malik Bader Hasan

Get full text
Get full text
Get full text

Development an accurate and stable range-free localization scheme for anisotropic wireless sensor networks by Han, Fengrong

“…Nevertheless, as the representative range-free localization scheme, Distance Vector-Hop (DV-Hop) localization algorithm demonstrates extremely poor localization accuracy under anisotropic wireless sensor networks. …”
Get full text
Get full text

Local search manoeuvres recruitment in the bees algorithm by Muhamad, Zaidi, Mahmuddin, Massudi, Nasrudin, Mohammad Faidzul, Sahran, Shahnorbanun

“…Swarm intelligence of honey bees had motivated many bioinspired based optimisation techniques. The Bees Algorithm (BA) was created specifically by mimicking the foraging behavior of foraging bees in searching for food sources.During the searching, the original BA ignores the possibilities of the recruits being lost during the flying.The BA algorithm can become closer to the nature foraging behavior of bees by taking account of this phenomenon.This paper proposes an enhanced BA which adds a neighbourhood search parameter which we called as the Local Search Manoeuvres (LSM) recruitment factor.The parameter controls the possibilities of a bee extends its neighbourhood searching area in certain direction.The aim of LSM recruitment is to decrease the number of searching iteration in solving optimization problems that have high dimensions.The experiment results on several benchmark functions show that the BA with LSM performs better compared to the one with basic recruitment.…”
Get full text
Get full text
Get full text

Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah A., Parman S., Abbasi A., Solihin M.I., Manan T.S.A., Beddu S., Ahmad A., Rasdi N.W.

Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon

“…The main objective of this research is to validate the NIRR algorithm by developing a comprehensive simulation model using Discrete Event Simulation (DES). …”
Get full text
Get full text

1D Multigrid Solver For Finite Element Method by Azhar, Mohamad Amiruddin

“…The new algorithm also has been tested using time simulation. …”
Get full text
Get full text

Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon, Ahmad, Idawaty

“…The main objective of this research is to validate the NIRR algorithm by developing a comprehensive simulation model using Discrete Event Simulation (DES). …”
Get full text
Get full text
Get full text

Implementing Kempe chain neighborhood structure in harmony search for solving curriculum based course timetabling by Wahid, Juliana, Mohd Hussin, Naimah

“…An essential aspect that contributes to the success of meta-heuristic algorithm over a curriculum-based course timetabling problem is determined by the neighborhood structure used.The basic neighborhood structures such as move and swap between lectures has no method for escaping from local minima or optimum that restricts the improvement of current solutions. …”
Get full text
Get full text
Get full text

Mathematical snalysis of blood vessels segmentation based on three retinal images datasets by Bilal, Sara Mohammed Osman Saleh, Munir, Fatin, Khalifa, Othman Omran

“…Because of the acquisition process, very often these images are non-uniformly illuminated and exhibit local luminosity and contrast variability. In this work, three basic algorithms for segmenting retinal blood vessels, based on different image processing techniques which are Matched filter, Hough transform and Morphological operations are used and their strengths and weaknesses in terms of retinal images segmentation are compared mathematically. …”
Get full text
Get full text

Mathematical formulation of tabu search in combinatorial optimization by Ismail, Zuhaimy

“…Tabu Search (TS) is a heuristic method based on the use of prohibition-based techniques and basic heuristics algorithms like local search. …”
Get full text
Get full text