Search Results - (( most selection problem algorithm ) OR ( java simulation optimization algorithm ))

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…Global pheromone update is performed after the completion of 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 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

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…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

Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

“…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

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…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

Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text

Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-way Testing by Muazu, A.A., Hashim, A.S., Sarlan, A.

“…Metaheuristic algorithm is a very important area of research that continuously improve in solving optimization problems. …”
Get full text
Get full text

Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…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

Tourist Trip Design Problem with user preference and popularity: a case study of Langkawi Island / Nabilah Anuar Ahmad and Huda Zuhrah Ab. Halim by Anuar Ahmad, Nabilah, Ab. Halim, Huda Zuhrah

“…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

Comparison between Genetic Algorithm and Prey-Predator Algorithm. by Ong, Hong Choon

“…We also compared the performance of this algorithm with the genetic algorithm on selected test problems and we showed that the new algorithm performed better in our publication.…”
Get full text

Broadening selection competitive constraint handling algorithm for faster convergence by Shaikh, T.A., Hussain, S.S., Tanweer, M.R., Hashmani, M.A.

“…The proposed algorithm is found to provide better solutions and achieve significantly faster convergence in most of the problems. …”
Get full text
Get full text

Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

“…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

Automated scheduling of hostel room allocation using genetic algorithm by Rayner Alfred, Hin, Fuk Yu

“…This paper proposes a hierarchical heuristics approach to cope with hostel room allocation problem. The proposed approach involves selecting eligible students using rank based selection method and allocating selected students to the most suitable hostel room possible via the implementation of a genetic algorithm (GA). …”
Get full text
Get full text
Get full text

Mutable composite firefly algorithm for gene selection in microarray based cancer classification by Fajila, Mohamed Nisper Fathima

“…This leads to the classification accuracy and genes subset size problem. Hence, this study proposed to modify the Firefly Algorithm (FA) along with the Correlation-based Feature Selection (CFS) filter for the gene selection task. …”
Get full text
Get full text

A novel explanatory hybrid artificial bee colony algorithm for numerical function optimization by Jarrah, Muath Ibrahim, Mohamad Jaya, Abdul Syukor, Mohd Abid, Mohd Asyadi Azam, Alqattan, Zakaria N., Azam, Mohd Asyadi, Abdullah, Rosni, Jarrah, Hazim, Abu‑Khadrah, Ahmed Ismail

“…ABC is one of the most popular algorithms in solving diferent kinds of optimization problems. …”
Get full text
Get full text
Get full text

Attribute related methods for improvement of ID3 Algorithm in classification of data: A review by Nur Farahaina, Idris, Mohd Arfian, Ismail

“…Decision tree is an important method in data mining to solve the classification problems. There are several learning algorithms to implement the decision tree but the most commonly-used is ID3 algorithm. …”
Get full text
Get full text
Get full text

Scaled Conjugate Gradient using strong Wolfe line search for portfolio selection / Nurfatihah Anizan by Anizan, Nurfatihah

“…Numerically, SLAMR outperforms others by solving all the test functions, followed by SAMRI (99.06%), SRMIL (91.25%), and SNMR (81.56%). LAMR is the most effective algorithm among those compared, balancing quick problem-solving and solving a larger number of problems. …”
Get full text
Get full text