Search Results - (( using electron path algorithm ) OR ( simulation optimization method algorithm ))

Refine Results
  1. 1

    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

    Published 2012
    “…Therefore, the second design is the best approach in optimizing the optimal path trace back for Smith Waterman algorithm. …”
    Get full text
    Get full text
    Student Project
  2. 2

    Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article by Saliman, Nur Farah Ain

    Published 2012
    “…This will cause disadvantages in the performance and speed level of the Smith-Waterman Algorithm. Thus, based on other researchers there was various kind of method being use in order to overcome this problem. …”
    Get full text
    Get full text
    Article
  3. 3

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  5. 5

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

    Published 2004
    “…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

    Published 2025
    “…Through extensive simulations across various static environment maps, we demonstrate that the ABGPSO algorithm outperforms existing state-of-the-art optimization techniques, including Genetic Algorithms (GA), Grey Wolf Optimization (GWO), and modern optimizers like the Sine Cosine Algorithm (SCA), Harris Hawks Optimization (HHO) and Reptile search algorithm (RSA). …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Novel algorithm for mobile robot path planning in constrained environment by Aisha, Muhammad, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi Faiz, ., Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi, Faiz, Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Transmission path optimization Based on Efficiency Communication System by Jin Fan, Kit, Guan Lim, Sin, Helen Ee Chuo, Min, Keng Tan, Ali Farzamnia, Tze, Kenneth Kin Teo

    Published 2022
    “…In this paper, routing attribute table that is maintained by the nodes, the density and relative distance of node distribution, is used to determine the clustering method. At the same time, the developed algorithm combines the relative position of the cluster and the base station to further improve the routing method of the sub-cluster head, Finally, the algorithm analyzes the influence of different parameters on the transmission path, and use the simulation experiments to evaluate the conclusions.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

    Published 2024
    “…Particle swarm optimization (PSO) outperforms conventional methods like artificial potential fields (APF), the Dijkstra algorithm, and the A* algorithm in path planning for mobile robots. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  11. 11
  12. 12

    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
    “…This study aims to evaluate the effectiveness of two optimization algorithms, artificial bee colony (ABC) and spiral dynamic algorithm (SDA), in controlling the position of a flexible-link manipulator. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network by Halim, Nurul Hamimi

    Published 2018
    “…Coverage and energy efficiency metrics are two fundamental issues for almost all types of application in wireless sensor network (WSNs).Coverage reflects how well an area is monitored by sensor nodes and in energy efficient networks where less energy is consumed to provide the same level of services.These twin specifics are presented to evaluate the performance of a wireless sensor network.Due to its simplicity and ease of analysis,full coverage is widely implemented in many theoretical studies.However,sometimes full coverage is not the best way to represent some real-world application due to its strong restrictions and its deterministic characteristics.In this thesis,Modified Harmony Search algorithm (MHS) is proposed to achieve a sensor node deployment such that the covered area is optimal and data transfer has low energy consumption.Through computer simulations, experimental results verified that the proposed method improved the coverage of area in compare to some related methods.Based on the result obtain from every experiments,coverage area percentage performance is affected by the number of hotspots.This is shown by Harmony Search (HS) based method where the coverage area percentage increases as the number of hotspot increase. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Articulated robots motion planning using foraging ant strategy by Mohamad, Mohd. Murtadha

    Published 2008
    “…However, the performance of this method is sub-optimal in terms of the number of configurations generated, length of path, amount of collision checking and computational time. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18

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

    Published 2009
    “…The secondary path of the ANC system is modeled by using the LMS algorithm to complete the design of the Filtered-X Least Mean Square (FXLMS) controller. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Node Participation Evaluation Scheme Based on Link Quality for Energy Efficient Routing in Ad-hoc Networks by Tie, Tai Hieng

    Published 2016
    “…Between, intermediate nodes with energy level below predefined threshold were not chosen as forwarding node in order to prevent early route breakage and retransmission. Computer simulations using NS-2 simulator are performed with comparison to the conventional methods and the effectiveness of the proposed methods is quantitatively validated. …”
    Get full text
    Get full text
    Thesis
  20. 20