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

Refine Results
  1. 1

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

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

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

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

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

    Published 2024
    “…Performance indicators included the Akaike Information Criterion (AIC), Bayesian Information Criterion (BIC), and Parameter Magnitude-based Information Criterion 2 (PMIC2). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Delay and energy-aware routing for efficient data collection in wireless sensor networks / Ihsan Ali by Ihsan , Ali

    Published 2024
    “…Both Bat Algorithm parameters and AFW parameters are adaptively tuned to balance exploration and exploitation throughout the optimization process. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

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

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

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

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

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

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

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

    Classification of labour pain using electroencephalogram signal based on wavelet method / Sai Chong Yeh by Sai , Chong Yeh

    Published 2020
    “…The training and parameters selection of the machine learning algorithms are conducted using EEG data collected from ten subjects in the laboratory. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…An example of a numerical algorithm is the simulated Kalman filter (SKF). Various method has been introduced as an extension of a numerical algorithm to adapt it to a discrete search space. …”
    Get full text
    Get full text
    Thesis