Search Results - (( discrete optimization modified algorithm ) OR ( using optimization method algorithm ))

Refine Results
  1. 1

    A modified discrete filled function algorithm for solving nonlinear discrete optimization problems by Woon, Siew Fang, Rehbock, Volker, Loxton, Ryan

    Published 2012
    “…The discrete filled function method is a global optimization tool for searching for best solution amongst multiple local optima.This method has proven useful for solving large-scale discrete optimization problems.In this paper, we consider a standard discrete filled function algorithm in the literature and then propose a modification to increase its efficiency.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Optimizing Decentralized Exam Timetabling with a Discrete Whale Optimization Algorithm by Emily Siew, Sing Kiang, Sze, San Nah, Goh, Say Leng

    Published 2025
    “…In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Optimizing decentralized exam timetabling with a discrete whale optimization algorithm by Emily Sing Kiang Siew, San nah sze, Say leng goh

    Published 2025
    “…—In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…It is also discovered that the hybrid-discrete MOPSO (HD-MOPSO) algorithm manages to obtain higher values in the performance metrics consisting of non-dominance ratio and hypervolume compared to the competing algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, Hishamuddin, Abd. Samad, M. F., Ahmad, Robiah, Yaacob, M. S.

    Published 2007
    “…The genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
    Get full text
    Get full text
    Article
  6. 6

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, H., Samad, M. F. A., Ahmad, R., Yaacob, M. S.

    Published 2007
    “…he genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
    Get full text
    Get full text
    Article
  7. 7

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…Genetic algorithms (GAs) have received significant interest from researchers and have been applied to various optimization problems. …”
    Get full text
    Get full text
    Article
  8. 8

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…Genetic algorithms (GAs) have received significant interest from researchers and have been applied to various optimization problems. …”
    Get full text
    Get full text
    Article
  9. 9

    Model structure selection for a discrete-time non-linear system using genetic algorithm by Ahmad, Robiah, Jamaluddin , Hishamuddin, Hussain, Mohd. Azlan

    Published 2004
    “…Genetic algorithms (GAs) have received significant interest from researchers and have been applied to various optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Abd Samad, Md Fahmi

    Published 2007
    “…The genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Hybridization of modified sine cosine algorithm with tabu search for solving quadratic assignment problem by Nurdiyana, Jamil

    Published 2022
    “…Sine Cosine Algorithm (SCA) is a population-based metaheuristic method that widely used to solve various optimization problem due to its ability in stabilizing between exploration and exploitation. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, Mohd Azlan

    Published 2004
    “…Genetic algorithms (GAs) have received significant interest from researchers and have been applied to various optimization problems. …”
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Artificial Bee Colony-based satellite image contrast and brightness enhancement technique using DWT-SVD by Bhandari, A.K., Soni, V., Kumar, A., Singh, G.K.

    Published 2014
    “…The proposed technique is based on the Artificial Bee Colony (ABC) algorithm using Discrete Wavelet Transform and Singular Value Decomposition (DWT-SVD). …”
    Get full text
    Get full text
    Article
  15. 15

    Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak by Emily Sing Kiang, Siew

    Published 2025
    “…The original WOA is modified by replacing the equations designed for continuous problem domains with local search methods, enhancing its adaptability to discrete optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    New fundamental theory in solving the royalty payment problem / Wan Noor Afifah Wan Ahmad and Suliadi Firdaus Sufahani by Wan Ahmad, Wan Noor Afifah, Sufahani, Suliadi Firdaus

    Published 2021
    “…It is expected that the new modified shooting method will give a more accurate optimal solution when compared with the discretization method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Discrete-time system identification using genetic algorithm with single parent-based mating technique by Zainuddin, Farah Ayiesya

    Published 2024
    “…System identifiction (SI) is a methodology for developing mathematical models of dynamic systems using measurements of input and output signals. This research focuses on improving Genetic Algorithms (GA) for SI, specifically addressing inefficiencies in common crossover operators that limit search space exploration and lead to premature convergence. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    EMG Feature Selection And Classification Using A Pbest-Guide Binary Particle Swarm Optimization by Too, Jing Wei, Tee, Wei Hown, Abdullah, Abdul Rahim, Mohd Saad, Norhashimah

    Published 2019
    “…In order to measure the effectiveness of PBPSO, binary particle swarm optimization (BPSO), genetic algorithm (GA), modified binary tree growth algorithm (MBTGA), and binary differential evolution (BDE) were used for performance comparison. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Image watermarking optimization algorithms in transform domains and feature regions by Tao, Hai

    Published 2012
    “…The achieved tradeoffs from these techniques between imperceptibility and robustness are controversial.To solve this problem,this study proposes the application of artificial intelligent techniques into digital watermarking by using discrete wavelet transform (DWT) and singular value decomposition (SVD).To protect the copyright information of digital images,the original image is decomposed according to two-dimensional discrete wavelet transform.Subsequently the preprocessed watermark with an affined scrambling transform is embedded into the vertical subband (HLm) coefficients in wavelet domain without compromising the quality of the image.The scaling factors are trained with the assistance of Particle Swarm Optimization (PSO).A new algorithmic framework is used to forecast feasibility of hypothesized watermarked images.In addition,the novelty is to associate the Hybrid Particle Swarm Optimization (HPSO),instead of a single optimization,as a model with SVD.To embed and extract the watermark,the singular values of the blocked host image are modified according to the watermark and scaling factors. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Design Of Feature Selection Methods For Hand Movement Classification Based On Electromyography Signals by Too, Jing Wei

    Published 2020
    “…The second method is called the Modified Binary Tree Growth Algorithm (MBTGA) that applies swap, crossover, and mutation operators. …”
    Get full text
    Get full text
    Get full text
    Thesis