Search Results - probable evaluation ((((method algorithm) OR (search algorithm))) OR (path algorithm))

Refine Results
  1. 1

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

    Published 2019
    “…In the benchmarking of the SKF and ssSKF algorithms’ performance in solving the 14-hole PCB drill path optimization case study with recent implementations, on average, both algorithms show the ability to converge to the optimal solution at a smaller number of function evaluations compared to the Gravitational Search Algorithm (GSA), Cuckoo Search (CS), and Intelligent Water Drop (IWD), although fall-short to the Taguchi- Genetic Algorithm optimization algorithm.…”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Design of A unmanned aerial vehicles assisted search and rescue collaboration architecture for emergency communication systems / Abdu Ahmed Saif Ahmed by Abdu Ahmed , Saif Ahmed

    Published 2022
    “…The multi-UAV and SAR collaboration have been evaluated based on average capacity, energy efficiency, line-of-sight probability, path loss, throughput performance, coverage probability analysis and outage probability performance. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    Tree-based contrast subspace mining method by Florence Sia Fui Sze

    Published 2020
    “…Then, the tree-based method, the genetic algorithm based parameter values identification of tree-based method, and followed by the genetic algorithm based tree-based method, for numerical data sets are developed and evaluated. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…The simulation results indicate that the algorithm is able to segregate and assign the tasks for each scanning head and also able to find the shortest scanning path for different types of objects coordination. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Deterministic Mutation-Based Algorithm for Model Structure Selection in Discrete-Time System Identification by Abd Samad, Md Fahmi

    Published 2011
    “…Since EC, like genetic algorithm, relies on randomness and probabilities, it is cumbersome when constraints are present in the search. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Refinement of Tuned Mass Damper parameters on machine support structure using dynamic Cuckoo Search algorithm by Ahmad Muinuddin, Mahmood, Zamri, Mohamed, Rosmazi, Rosli

    Published 2025
    “…This study proposes the use of a dynamic Cuckoo Search (CS) algorithm, a nature-inspired optimization method, to enhance the accuracy of TMD parameters when external factors, such as excitation frequency or structural properties, change. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa by Che Isa, Muhammad Izzat Imran

    Published 2017
    “…The more number of marbles, the higher the search accuracy. In future, traditional marble game can be applied with other search algorithm to optimize the solution…”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
  13. 13

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
  14. 14

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

    Published 2020
    “…A new mutation vector inspired by the two-opposite path (2-Opt) algorithm with adaptive mutation scalar (F ) and crossover rate (CR) control parameters were employed to enhance the exploration and exploitation phases of the proposed algorithm. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…Having only one parameter control (i.e. the switch probability, pa) to choose from the global search (i.e. exploration) and local search (i.e. exploitation) is the main strength of FPA as compared to other meta-heuristic algorithms. …”
    Get full text
    Get full text
    Article
  18. 18

    Performance analysis of pair-wise error probability for 1/3 and 1/4 subcarrier mapping ICI-SC scheme in STFBC MIMO-OFDM system / Norhayati Abdullah by Abdullah, Norhayati

    Published 2015
    “…The simulation results expressively show that the one third method subcarrier mapping technique with Decision Feedback Equalizer (DFE) and adaptive algorithm can provide the best system performance compared to the existing subcarrier mapping methods .The results shows that by using the one-third subcarrier mapping scheme with an adaptive algorithm Normalised Least Means Square (NLMS), an efficient bandwidth can be achieved, ICI and ISI effects can be reduced with 24% of improvement compared to one-third subcarrier mapping Recursive Least Square (RLS) DFE in the MIMO-OFDM system.…”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…Having only one parameter control (i.e. the switch probability, pa) to choose from the global search (i.e. exploration) and local search (i.e. exploitation) is the main strength of FPA as compared to other meta-heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Article