Search Results - (( discrete optimization using algorithm ) OR ( java application customization 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
    “…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Thesis
  2. 2

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

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

    Published 2015
    “…Later, binary gravitational search algorithm (BGSA) is designed to solve discrete optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    An improve unsupervised discretization using optimization algorithms for classification problems by Mohamed, Rozlini, Samsudin, Noor Azah

    Published 2024
    “…Recognizing the critical role of discretization in enhancing classification performance, the study integrates equal width binning (EWB) with two optimization algorithms: the bat algorithm (BA), referred to as EB, and the whale optimization algorithm (WOA), denoted as EW. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    An improve unsupervised discretization using optimization algorithms for classification problems by Mohamed, Rozlini, Samsudin, Noor Azah

    Published 2024
    “…Recognizing the critical role of discretization in enhancing classification performance, the study integrates equal width binning (EWB) with two optimization algorithms: the bat algorithm (BA), referred to as EB, and the whale optimization algorithm (WOA), denoted as EW. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

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

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

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

    Published 2022
    “…However, these extensions may result in increased execution times for the algorithm. In this research, a new combinatorial algorithm named discrete simulated Kalman filter optimizer (DSKFO) is proposed to solve combinatorial optimization problem. …”
    Get full text
    Get full text
    Thesis
  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

    Optimizing support vector machine parameters using continuous ant colony optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…Hence, in applying Ant Colony Optimization for optimizing Support Vector Machine parameters, which are continuous parameters, there is a need to discretize the continuous value into a discrete value.This discretization process results in loss of some information and, hence, affects the classification accuracy and seek time.This study proposes an algorithm to optimize Support Vector Machine parameters using continuous Ant Colony Optimization without the need to discretize continuous values for Support Vector Machine parameters.Seven datasets from UCI were used to evaluate the performance of the proposed hybrid algorithm.The proposed algorithm demonstrates the credibility in terms of classification accuracy when compared to grid search techniques.Experimental results of the proposed algorithm also show promising performance in terms of computational speed.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

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

    Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    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
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

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

    Solving SVM model selection problem using ACOR and IACOR by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Ant Colony Optimization (ACO) has been used to solve Support Vector Machine (SVM) model selection problem.ACO originally deals with discrete optimization problem. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Multi-objective Binary Clonal Selection Algorithm In The Retrieval Phase Of Discrete Hopfield Neural Network With Weighted Systematic Satisfiability by Romli, Nurul Atiqah

    Published 2024
    “…The proposed algorithm in the retrieval phase showed optimal performance as compared to the baseline algorithms. …”
    Get full text
    Get full text
    Thesis