Search Results - (( discrete optimization based algorithm ) OR ( time optimization method algorithm ))

Refine Results
  1. 1

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

    Published 2024
    “…Hence, optimization algorithms, consisting of exact and heuristic methods, are crucial for a myriad of real-world applications. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

    Published 2009
    “…One of the more recent global optimization tools in the area of discrete optimization is known as the discrete filled function method. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

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

    Published 2019
    “…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
    Get full text
    Get full text
    Thesis
  5. 5

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

    Published 2004
    “…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. 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
  6. 6

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

    Published 2004
    “…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. 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
  7. 7

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

    Published 2004
    “…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. 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
  8. 8

    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
  9. 9

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

    Published 2014
    “…Hence, this project, which propose the usage of assisted history matching technique with Genetic Algorithm (GA) as the optimization tool and Discrete Cosine Transform (DCT) as the parameter reduction method is carried out in order to achieve the objective of minimizing the time taken to do history matching. …”
    Get full text
    Get full text
    Final Year Project
  10. 10
  11. 11

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

    Published 2011
    “…Evolutionary computation (EC) is known to be an effective search and optimization method and in this paper EC is proposed as a model structure selection algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Improvement and application of particle swarm optimization algorithm by Deevi, Durga Praveen, Kodadi, Sharadha, Allur, Naga Sushma, Dondapati, Koteswararao, Chetlapalli, Himabindu, Perumal, Thinagaran

    Published 2025
    “…Finally, real-world tests are performed to verify the proposed Algorithm's efficacy compared to existing optimization methods. …”
    Get full text
    Get full text
    Article
  13. 13

    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
  14. 14

    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
  15. 15

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

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

    Published 2004
    “…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. 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
  18. 18

    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
  19. 19

    An efficient indexing and retrieval of iris biometrics data using hybrid transform and firefly based K-means algorithm title by Khalaf, Emad Taha

    Published 2019
    “…It uses a weighted K-means clustering algorithm based on the improved FA to optimize the initial clustering centers of K-means algorithm, known as Weighted K-means clustering-Improved Firefly Algorithm (WKIFA). …”
    Get full text
    Get full text
    Thesis
  20. 20