Search Results - (( using discretization based algorithm ) OR ( basic selection method algorithm ))

Refine Results
  1. 1

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

    Published 2022
    “…Besides, since PSO operates in the continuous domain, it cannot be applied directly to solve a discrete problem like the JSP efficiently. This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

    Published 2005
    “…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Fingerprint Image Compression Using Wavelet Transform by Hanashi, Abdalla Musbah

    Published 2003
    “…The objective of this study is to evaluate a variety of wavelet filters using Wavelet toolbox for selecting the best wavelet filters to be used in compress and decompress of selected fingerprint images. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem by Ismail, Ibrahim, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2015
    “…In this study, rule-based multi-state gravitational search algorithm (RBMSGSA) algorithm is proposed to solve discrete combinatorial optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

    Published 2024
    “…The steepest-ascent hill climbing algorithm is used as a local search technique to improve the exploitation of the adapted discrete DA. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Multi-state PSO GSA for solving discrete combinatorial optimization problems by Ismail, Ibrahim

    Published 2016
    “…These four algorithms can be used to solve discrete combinatorial optimization problems (COPs). …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

    Published 2011
    “…This thesis describes the development of an efficient algorithm for solving nonlinear stochastic optimal control problems in discrete-time based on the principle of model-reality differences. …”
    Get full text
    Get full text
    Thesis
  10. 10

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

    Published 2004
    “…In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Article
  11. 11

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

    Published 2004
    “…In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Article
  12. 12

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

    Published 2004
    “…In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Denosing of natural image based on non-linear threshold filtering using discrete wavelet transformation by Khmag, Asem, Ramli, Abdul Rahman, Syed Mohamed, Syed Abdul Rahman Al-Haddad, Hashim, Shaiful Jahari

    Published 2014
    “…This paper treats with threshold estimation technique to reduce the noise in natural images by using on discrete wavelet transformation. Calculating the value of thresholding, the way it works in the algorithm (derivation of thresholding function) and the type of wavelet mother functions, are pivotal issues in the field of denoising based wavelet approach. …”
    Get full text
    Get full text
    Article
  14. 14

    Chebyshev approximation of discrete polynomials and splines by Che Seman, Fauziahanim

    Published 2004
    “…This work is concerned with the approximation of discrete data using polynomials and splines based on the Chebyshev approximation criterion. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Chebyshev approximation of discrete polynomials and splines by Che Seman, Fauziahanim

    Published 2004
    “…This work is concerned with the approximation of discrete data using polynomials and splines based on the Chebyshev approximation criterion. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Assisted History Matching by Using Genetic Algorithm and Discrete Cosine Transform by Abdul Rashid, Abdul Hadi

    Published 2014
    “…Later, an algorithm combining both Genetic Algorithm and Discrete Cosine Transform was proposed, which shows the step-by-step sequence of both methods. …”
    Get full text
    Get full text
    Final Year Project
  17. 17

    A Modified Gravitational Search Algorithm for Discrete Optimization Problem by Zuwairie, Ibrahim, Zulkifli, Md. Yusof, Shahdan, Sudin, Sophan Wahyudi, Nawawi, Amar Faiz, Zainal Abidin, Muhammad Arif, Abdul Rahim, Kamal, Khalil

    Published 2014
    “…This paper presents a modified Gravitational Search Algorithm (GSA) called Discrete Gravitational Search Algorithm (DGSA) for discrete optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

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

    Published 2004
    “…In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Article
  19. 19

    A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem by Asaad Shakir, Hameed, Mohd Aboobaider, Burhanuddin, Mutar, Modhi Lafta, Ngo, Hea Choon

    Published 2020
    “…The primary aim of this study is to propose a hybrid approach which combines Discrete Differential Evolution (DDE) algorithm and Tabu Search (TS) algorithm to enhance solutions of QAP model, to reduce the distances between the locations by finding the best distribution of N facilities to N locations, and to implement hybrid approach based on discrete differential evolution (HDDETS) on many instances of QAP from the benchmark. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    A fast discrete gravitational search algorithm by Hasrul, Che Shamsudin, Addie Irawan, Hashim, Zuwairie, Ibrahim, Amar Faiz, Zainal Abidin, Sophan Wahyudi, Nawawi, Muhammad Arif, Abdul Rahim, Kamal, Khalil

    Published 2012
    “…This study introduces a variant of Gravitational Search Algorithm (GSA) for discrete optimization problems, namely, Fast Discrete Gravitational Search Algorithm (FDGSA). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item