Search Results - (( using evolution path algorithm ) OR ( basic (equalization OR localization) based algorithm ))

Refine Results
  1. 1

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
  2. 2

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.…”
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4
  5. 5

    Application Of Multi-Layer Perceptron Technique To Detect And Locate The Base Of A Young Corn Plant by Morshidi, Malik Arman

    Published 2007
    “…Morphological operation is applied to remove the small blobs. Prior to localization of the base of young corn tree, skeletonizing operation is performed to get the basic shape of the object. …”
    Get full text
    Get full text
    Thesis
  6. 6

    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

    Published 2020
    “…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
    Article
  7. 7

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

    Published 2019
    “…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
    Thesis
  8. 8

    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

    Published 2022
    “…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
    Article
  9. 9
  10. 10

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

    Published 2022
    “…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
    Thesis
  11. 11

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

    Published 2011
    “…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
    Conference or Workshop Item
  12. 12

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

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

    Literature Review of Optimization Techniques for Chatter Suppression In Machining by A. R., Yusoff, Mohamed Reza Zalani, Mohamed Suffian, Mohd Yusof, Taib

    Published 2011
    “…In this paper, it can be observed that for chatter suppression, optimization focuses on spindle design, tool path, cutting process, and variable pitch. Various algorithms can be applied in the optimization of machining problems; however, Differential Evolution is the most appropriate for use in chatter suppression, being less time consuming, locally optimal, and more robust than both Genetic Algorithms, despite their wide applications, and Sequential Quadratic Programming, which is a famous conventional algorithm.…”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators by Nor Maniha, Abdul Ghani, Nizaruddin, M. Nasir, Azrul Azim, Abdullah Hashim

    Published 2024
    “…Interestingly, the manipulator's behaviours using the spiral dynamics algorithm for PID controller tuning were superior to those using alternative methods. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Fingerprint frontier: the evolution of biometric security by Khalifa, Othman Omran

    Published 2023
    “…The author believes that "Fingerprint Frontier: The Evolution of Biometric Security" will serve as a complete reference, shining light on the current landscape while exposing potential future paths in this ever-changing subject. …”
    Get full text
    Get full text
    Get full text
    Book
  17. 17

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

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

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

    Published 2013
    “…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
    Conference or Workshop Item
  19. 19

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

    Published 2014
    “…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
    Proceeding Paper
  20. 20

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
    Get full text
    Get full text
    Get full text
    Thesis