Search Results - (( based permutation parallel algorithm ) OR ( evolution optimisation based algorithm ))

  • Showing 1 - 20 results of 20
Refine Results
  1. 1

    A permutation parallel algorithm under exchange restriction with message passing interface by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2014
    “…Permutations. However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducing the computation time. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Parallel strategy for starter sets to list all permutation based on cycling restriction by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar

    Published 2011
    “…permutations.The sequential algorithm is developed and parallelized for parallel computing by integrating with Message Passing Interface (MPI) libraries. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2013
    “…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

    Published 2013
    “…The research also aims to generalise the Sarrus Rule for any order of square matrices based on permutations which are derived using starter sets. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Performance evaluation and benchmarking of an extended computational model of ant colony system for DNA sequence design by Zuwairie, Ibrahim, Mohd Falfazli, Mat Jusof, Mohd Zaidi, Mohd Tumari

    Published 2014
    “…Ant colony system (ACS) algorithm is one of the biologically inspired algorithms that have been introduced to effectively solve a variety of combinatorial optimisation problems. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

    Published 2007
    “…Finally Four Heuristic and Difference Increasing and Decreasing routing algorithms based on bitwise operation are established. …”
    Get full text
    Get full text
    Thesis
  8. 8

    A competitive co-evolutionary approach for the nurse scheduling problem by Mohamad Nazri, Maizatul Farhana, Mohd Yusoh, Zeratul Izzah, Basiron, Halizah, Daud, Azlina

    Published 2026
    “…The competitive approach further exhibits smoother convergence behaviour across generations, indicating stronger optimisation dynamics and improved robustness. These findings demonstrate that competitive co-evolution provides an effective and practical alternative to static fitness-based evolutionary methods for nurse scheduling, with broader applicability to healthcare scheduling and constraint optimisation problems.…”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

    Published 2005
    “…The experiments conducted have proven that the proposed algorithms are effective and efficient. They are based on routing algorithms to minimize the number of passes to route all the inputs to outputs without crosstalk. …”
    Get full text
    Get full text
    Thesis
  11. 11

    A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, Fakhrud Din, Shah Khalid, Kamal Zuhairi Zamli, Aftab Alam

    Published 2025
    “…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, ., Fakhrud, Din, Shah, Khalid, Kamal Z., Zamli, Alam, Aftab

    Published 2025
    “…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Stock market turning points rule-based prediction / Lersak Photong … [et al.] by Photong, Lersak, Sukprasert, Anupong, Boonlua, Sutana, Ampant, Pravi

    Published 2021
    “…Finally, rule-based optimisation techniques such as Particle Swarm Optimization (PSO), Differential Evolution (DE) and Grey Wolf Optimizer (GWO) were used to minimise the amount of time employed in the stock market turning points prediction. …”
    Get full text
    Get full text
    Book Section
  14. 14

    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

    Published 2023
    “…Given a wide range of MAR-JSR permutations, selecting a suitable MAR-JSR pair for a FJSP becomes a challenge. …”
    Get full text
    Get full text
    Thesis
  15. 15

    B-spline curve fitting with different parameterization methods by Kheng, Jia Shen

    Published 2020
    “…After generating control points, distance between the generated and original data points is used to identify the error of the algorithm. Later, genetic algorithm and differential evolution optimization are used to optimise the error of the curve. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  16. 16

    Reliability assessment of power system generation adequacy with wind power using population-based intelligent search methods by Kadhem, Athraa Ali

    Published 2017
    “…This study sought to examine the performance of three newly proposed techniques, for reliability assessment of the power systems, namely Disparity Evolution Genetic Algorithm (DEGA), Binary Particle Swarm Optimisation (BPSO), and Differential Evolution Optimization Algorithm (DEOA). …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    iBUST: An intelligent behavioural trust model for securing industrial cyber-physical systems by Azad, Saiful, Mahmud, Mufti, Kamal Zuhairi, Zamli, Kaiser, M. Shamim, Jahan, Sobhana, Razzaque, Md Abdur

    Published 2024
    “…In addition, a new optimisation model for finding optimum parameter values in the MEDF and an algorithm for transmuting a 1D quantitative feature into a respective categorical feature are developed to facilitate the model. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A self‐configured link adaptation for green LTE downlink transmission by Salman, Mustafa Ismael, Ng, Chee Kyun, Noordin, Nor Kamariah, Mohd Ali, Borhanuddin, Sali, Aduwati

    Published 2015
    “…Current and next‐generation cellular networks require such interactive techniques in order to be self‐optimised without complex modifications.…”
    Get full text
    Get full text
    Article
  20. 20

    Development of tool life prediction model of TiAlN coated tools during the high speed hard milling of AISI H13 steel by Amin, A. K. M. Nurul, Hafiz, A.M. Khalid, Lajis, M. A.

    Published 2011
    “…Shunmugam et al. [7] also combined RSM with differential evolution and genetic algorithms to draw a comparison between these methods. …”
    Get full text
    Get full text
    Get full text
    Book Chapter