Search Results - (( _ selection problems algorithm ) OR ( java simulation optimization algorithm ))
Search alternatives:
- selection problems »
- java simulation »
-
1
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
2
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text
Article -
3
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
4
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
5
Resource management in grid computing using ant colony optimization
Published 2011“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
6
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
Review -
7
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
8
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
Published 2019“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text
Thesis -
9
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 -
10
Fuzzy genetic algorithms for combinatorial optimisation problems
Published 2012“…The proposed sexual selection and the FGAs are applied to combinatorial optimization problems specifically to those involving selection problems. …”
Get full text
Get full text
Thesis -
11
SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment
Published 2024“…To conduct this experiment, we employed the CloudSim simulator, which is implemented using the Java programming language.…”
Get full text
Get full text
Get full text
Get full text
Article -
12
Broadening selection competitive constraint handling algorithm for faster convergence
Published 2020“…In this paper, a new algorithm incorporating broadening selection strategy in competitive constraint handling paradigm for finding the optimum solution in constrained problems has been proposed, referred as Broadening Selection Competitive Constraint Handling (BSCCH). …”
Get full text
Get full text
Article -
13
Some metaheuristic algorithms for solving multiple cross-functional team selection problems
Published 2022“…We can find solutions to the team selection problem in many different areas. The problem solver needs to scan across a large array of available solutions during their search. …”
Get full text
Get full text
Article -
14
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 -
15
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 -
16
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 -
17
Dengue classification system using clonal selection algorithm / Karimah Mohd
Published 2012“…At this point, Artificial Immune System (AIS) is one of the inspired biology technique which provide effective solutions for optimization and classificaton problems. One of AIS Algorithm is Clonal Selection Algorithm (CSA) is to classify dengue disease is a suitable to solve classification problem in this project . …”
Get full text
Get full text
Thesis -
18
Tourist Trip Design Problem with user preference and popularity: a case study of Langkawi Island / Nabilah Anuar Ahmad and Huda Zuhrah Ab. Halim
Published 2023“…This study proposed enhancement in the greedy algorithm approach (Benjamin et al., 2019). A greedy algorithm solves a problem that selects the most appropriate option based on the current situation. …”
Get full text
Get full text
Book Section -
19
Static and self-scalable filter range selection algorithms for peer-to-peer networks
Published 2011“…Two multiple selection algorithm, which are known as “static filter range selection algorithm” and “self-scalable selection algorithm” are proposed. …”
Get full text
Get full text
Thesis -
20
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
