Search Results - (( java application among algorithm ) OR ( using selection problems algorithm ))
Search alternatives:
- selection problems »
- application among »
- java application »
- among algorithm »
- using selection »
-
1
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Offloading heavy data size to a remote node introduces the problem of additional delay due to transmission. Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text
Article -
2
A Toolkit for Simulation of Desktop Grid Environment
Published 2014“…The prototypes will be developed using JAVA language united with a MySQL database. …”
Get full text
Get full text
Final Year Project -
3
Batch mode heuristic approaches for efficient task scheduling in grid computing system
Published 2016“…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
Get full text
Get full text
Get full text
Thesis -
4
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
Published 2008“…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
Get full text
Get full text
Thesis -
5
-
6
Direct approach for mining association rules from structured XML data
Published 2012Get full text
Get full text
Thesis -
7
Formulating new enhanced pattern classification algorithms based on ACO-SVM
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 -
8
Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection
Published 2020“…An improved version of Salp Swarm Algorithm (ISSA) is proposed in this study to solve feature selection problems and select the optimal subset of features in wrapper-mode. …”
Get full text
Get full text
Article -
9
Dengue classification system using clonal selection algorithm / Karimah Mohd
Published 2012“…Some popular intelligent techniques like Genetic Algorithm, Fuzzy Logic and Artificial Neural Network are often used by reasearcher to perform classifcation problems. …”
Get full text
Get full text
Thesis -
10
Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier
Published 2013“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text
Article -
11
Group formation using genetic algorithm
Published 2009Get full text
Get full text
Get full text
Get full text
Monograph -
12
A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization
Published 2018“…Numerous studies in optimization problems often lead to tailoring a specific algorithm to adapt to the problem instances, especially in expensive optimization problems. …”
Get full text
Get full text
Get full text
Article -
13
Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri
Published 2017“…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
Get full text
Get full text
Thesis -
14
Static and self-scalable filter range selection algorithms for peer-to-peer networks
Published 2011“…The research works were implemented by simulation in which it was used to identify the selection problem, implementation of the proposed algorithms and the measurement of the results. …”
Get full text
Get full text
Thesis -
15
Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian
Published 2013“…In this research, we showed how evolutionary multi-objective algorithms can be used to solve the view selection problem and its advantage over classical optimization problems were described. …”
Get full text
Get full text
Thesis -
16
Broadening selection competitive constraint handling algorithm for faster convergence
Published 2020“…The proposed algorithm has been evaluated using 24 benchmark functions. …”
Get full text
Get full text
Article -
17
Metaheuristic algorithms for feature selection (2014–2024)
Published 2025“…Metaheuristic algorithms are suited to provide solutions to feature selection problems because these problems are combinatorial and require an effective and efficient search through large solution spaces. …”
Get full text
Get full text
Get full text
Article -
18
Network game (Literati) / Chung Mei Kuen
Published 2003“…The possible applications of multimedia-networked system are endless, as the demand to support interactive communication among groups of users has increased significantly. …”
Get full text
Get full text
Thesis -
19
Improved whale optimization algorithm for feature selection in Arabic sentiment analysis
Published 2019“…To overcome these problems, two improvements for WOA algorithm are proposed in this paper. …”
Get full text
Get full text
Article -
20
Enhanced selection method for genetic algorithm to solve traveling salesman problem
Published 2017“…Genetic algorithms (GAs) have been applied by many researchers to get an optimized solution for hard problems such as Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Get full text
Conference or Workshop Item
