Search Results - (( using continuous optimization algorithm ) OR ( java application using algorithmic ))
Search alternatives:
- continuous optimization »
- java application »
- algorithmic »
-
1
Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems
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
Modification of particle swarm optimization algorithm for optimization of discrete values
Published 2011“…Using this method, the optimization is still done in continuous form, but the solution is generated in discrete form. …”
Get full text
Get full text
Research Reports -
3
RSA Encryption & Decryption using JAVA
Published 2006“…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
Get full text
Get full text
Final Year Project -
4
Identification of continuous-time hammerstein model using improved archimedes optimization algorithm
Published 2024“…Therefore, this article identified various continuous-time Hammerstein models based on an improved Archimedes optimization algorithm (IAOA) to address these concerns. …”
Get full text
Get full text
Get full text
Get full text
Article -
5
Optimizing support vector machine parameters using continuous ant colony optimization
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 -
6
Incremental continuous ant colony optimization for tuning support vector machine’s parameters
Published 2013“…Hence, in applying Ant Colony Optimization for optimizing Support Vector Machine parameters, which are continuous in nature, the values wil have to be discretized.The discretization process will result in loss of some information and, hence, affects the classification accuracy and seeks time.This paper presents an algorithm to optimize Support Vector Machine parameters using Incremental continuous Ant Colony Optimization without the need to discretize continuous values.Eight datasets from UCI were used to evaluate the performance of the proposed algorithm.The proposed algorithm demonstrates the credibility in terms of classification accuracy when compared to grid search techniques, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.Experimental results of the proposed algorithm also show promising performance in terms of classification accuracy and size of features subset.…”
Get full text
Get full text
Get full text
Article -
7
-
8
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
9
-
10
A hybrid metaheuristic algorithm for identification of continuous-time Hammerstein systems
Published 2021“…This paper presents a new hybrid identification algorithm called the Average Multi-Verse Optimizer and Sine Cosine Algorithm for identifying the continuous-time Hammerstein system. …”
Get full text
Get full text
Article -
11
Hybrid harmony search algorithm for continuous optimization problems
Published 2020“…Taken together, the proposed hybrid algorithm, called IHS-GWO, aims to address continuous optimization problems. …”
Get full text
Get full text
Thesis -
12
An improve unsupervised discretization using optimization algorithms for classification problems
Published 2024“…This paper addresses the classification problem in machine learning focusing on predicting class labels for datasets with continuous features. 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 -
13
An improve unsupervised discretization using optimization algorithms for classification problems
Published 2024“…This paper addresses the classification problem in machine learning, focusing on predicting class labels for datasets with continuous features. 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 -
14
Optimization of travelling salesman problem with precedence constraint using modified GA encoding
Published 2018“…Genetic algorithm (GA) is one of popular algorithm used to optimize TSPPC. …”
Get full text
Get full text
Get full text
Article -
15
Formulating new enhanced pattern classification algorithms based on ACO-SVM
Published 2013“…This paper presents two algorithms that integrate new Ant Colony Optimization (ACO) variants which are Incremental Continuous Ant Colony Optimization (IACOR) and Incremental Mixed Variable Ant Colony Optimization (IACOMV) with Support Vector Machine (SVM) to enhance the performance of SVM.The first algorithm aims to solve SVM model selection problem. …”
Get full text
Get full text
Get full text
Article -
16
Identification of continuous-time model of hammerstein system using modified multi-verse optimizer
Published 2021“…his thesis implements a novel nature-inspired metaheuristic optimization algorithm, namely the modified Multi-Verse Optimizer (mMVO) algorithm, to identify the continuous-time model of Hammerstein system. …”
Get full text
Get full text
Thesis -
17
Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization
Published 2013“…Ant Colony Optimization has been used to solve Support Vector Machine model selection problem.Ant Colony Optimization originally deals with discrete optimization problem.In applying Ant Colony Optimization for optimizing Support Vector Machine parameters which are continuous variables, there is a need to discretize the continuously value into discrete value.This discretize process would result in loss of some information and hence affect the classification accuracy and seeking time.This study proposes an algorithm that can optimize Support Vector Machine parameters using Continuous Ant Colony Optimization without the need to discretize continuous value for Support Vector Machine parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed hybrid algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.…”
Get full text
Get full text
Get full text
Article -
18
-
19
Hybrid ACO and SVM algorithm for pattern classification
Published 2013“…Ant Colony Optimization (ACO) is a metaheuristic algorithm that can be used to solve a variety of combinatorial optimization problems. …”
Get full text
Get full text
Get full text
Thesis -
20
A New Quadratic Binary Harris Hawk Optimization For Feature Selection
Published 2019“…Harris hawk optimization (HHO) is one of the recently proposed metaheuristic algorithms that has proven to be work more effectively in several challenging optimization tasks. …”
Get full text
Get full text
Get full text
Article
