Search Results - (( discrete optimization method algorithm ) OR ( parameter optimization model algorithm ))

Refine Results
  1. 1

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

    Published 2014
    “…Next, fluid flow equations were derived to obtain the forward model and eventually, the objective function. 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
  2. 2

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

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

    Published 2024
    “…The successful validation in real-world systems marks a significant milestone, showing that the SPM technique can significantly improve model optimization in diverse and practical contexts . …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Assisted History Matching by Using Recursive Least Square and Discrete Cosine Transform by Abu Talib, Muhammad Ashraf

    Published 2014
    “…Thus, this project is carried to do assisted history matching and to determine whether Recursive least square as optimization method and Discrete cosine transform as parameter reduction method can be combined or not. …”
    Get full text
    Get full text
    Final Year Project
  5. 5
  6. 6

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

    Published 2012
    “…A series of training patterns are constructed by employing between two images.Moreover,the work takes accomplishing maximum robustness and transparency into consideration.HPSO method is used to estimate the multiple parameters involved in the model. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Optimizing Visual Sensor Coverage Overlaps for Multiview Surveillance Systems by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

    Published 2018
    “…Then, the minimization and the maximization arrangements of the coverage overlapping are formulated as discrete optimization problems. The obtained solutions from the dynamic programming technique are evaluated with respect to local and global greedy search algorithms. …”
    Get full text
    Get full text
    Article
  9. 9

    Optimizing Visual Sensor Coverage Overlaps for Multiview Surveillance Systems by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

    Published 2018
    “…Then, the minimization and the maximization arrangements of the coverage overlapping are formulated as discrete optimization problems. The obtained solutions from the dynamic programming technique are evaluated with respect to local and global greedy search algorithms. …”
    Get full text
    Get full text
    Article
  10. 10

    Modelling of optimized hybrid debris flow using airborne laser scanning data in Malaysia by Lay, Usman Salihu

    Published 2019
    “…The general objective of the study was the development of optimized hybrid debris flow models using airborne laser scanning data and Machine learning algorithms in Malaysia. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Development of integrated models for distribution network design of perishable products by Firoozi, Zahra

    Published 2015
    “…A Lagrangian relaxationbased heuristic algorithm is developed to solve the model. The algorithm produces solutions that are within 0.027% of optimality gap.…”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Some families of count distributions for modelling zero-inflation and dispersion / Low Yeh Ching by Low, Yeh Ching

    Published 2016
    “…A popular distribution for the modelling of discrete count data is the Poisson distribution. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

    Published 2011
    “…We propose a novel modification to the PSO algorithm to perform rapid discrete optimization. The proposed Discrete-PSO method (DPSO) uses a rescaling equation to convert the continuous-valued positions into discrete-valued variables. …”
    Get full text
    Get full text
    Research Reports
  17. 17

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

    A Novel Discrete Filled Function Algorithm in Solving Discrete Optimization Problems (S/O: 12408) by Woon, Siew Fang, Karim, Sharmila, Mohamad, Mohd Saiful Adli

    Published 2016
    “…Several global methods have been proposed for solving discrete optimization problems. …”
    Get full text
    Get full text
    Monograph
  19. 19

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

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

    Published 2009
    “…These problems are known as discrete-valued optimal control problems. Most practical discrete-valued optimal control problems have multiple local minima and thus require global optimization methods to generate practically useful solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis