Search Results - (( java application using algorithm ) OR ( terms selection problem algorithm ))

Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

“…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
Get full text
Get full text
Get full text

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

“…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 algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism. …”
Get full text
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

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

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

Campus safe: Safeguarding GPS-based Physical Identity and Access Management (PIAM) system with a lightweight Geo-Encryption by Yeo Zi Zian

“…The selected lightweight geo-encryption algorithm will be implemented in the proposed system, vi which develops by using Java language. …”
Get full text
Get full text
Get full text

RSA Encryption & Decryption using JAVA by Ramli, Marliyana

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

Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

Get full text
Get full text
Get full text

Provider independent cryptographic tools by Ibrahim, Subariah, Salleh, Mazleena, Abdul Aziz, Shah Rizan

Get full text
Get full text
Get full text

Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

“…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
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

Fuzzy genetic algorithms for combinatorial optimisation problems by Varnamkhasti, Mohammad Jalali

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

Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows by Sankor, Salah Mortada Shahen

“…Additionally, the E-MABC algorithm is better than the MABC by 42.85%, MOLNS by 17.85%, GA-PSO and RRGA by 28.57%, and MODLEN by 46.42% in terms of NV. …”
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

Evolutionary algorithm with roulette-tournament selection for solving aquaculture diet formulation by Abd Rahman, Rosshairy, Ramli, Razamin, Jamari, Zainoddin, Ku-Mahamud, Ku Ruhana

“…In this paper, a new selection operator is introduced for a real valued encoding problem, which specifically exists in a shrimp diet formulation problem.This newly developed selection operator is a hybrid between two well-known established selection operators: roulette wheel and binary tournament selection.A comparison of the performance of the proposed operator and the other existing operator was made for evaluation purposes.The result shows that the proposed roulette-tournament selection is better in terms of its ability to provide many good feasible solutions when a population size of 30 is used.Thus, the proposed roulette-tournament is suitable and comparable to established selection for solving a real valued shrimp diet formulation problem.The selection operator can also be generalized to any problems related to EA.…”
Get full text
Get full text
Get full text

Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

“…An integrated solution for the above problem is the ECQ Routing Algorithm. ECQ Routing Algorithm is integrates the Variable of Decay Constant and Update All Q Value approaches for updating the C values of non-selected Q values. …”
Get full text
Get full text

A New Quadratic Binary Harris Hawk Optimization For Feature Selection by Abdullah, Abdul Rahim, Too, Jing Wei, Mohd Saad, Norhashimah

“…In this study, twenty-two datasets collected from the UCI machine learning repository are used to validate the performance of proposed algorithms. A comparative study is conducted to compare the effectiveness of QBHHO with other feature selection algorithms such as binary differential evolution (BDE), genetic algorithm (GA), binary multi-verse optimizer (BMVO), binary flower pollination algorithm (BFPA), and binary salp swarm algorithm (BSSA). …”
Get full text
Get full text
Get full text

A new ant based rule extraction algorithm for web classification by Ku-Mahamud, Ku Ruhana, Saian, Rizauddin

“…Using Classifier-based attribute subset selection will reduce more attributes, but sacrifice the performance of the classifier.A hybrid ant colony optimization with simulated annealing algorithm to discover rules from data is proposed.The simulated annealing technique will minimize the problem of low quality discovered rule by an ant in a colony.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The rule set is arranged in decreasing order of generation.Thirteen data sets which consist of discrete and continuous data were used to evaluate the performance of the proposed algorithm in terms of accuracy, number of rules and number of terms in the rules.Experimental results obtained from the proposed algorithm are comparable to the results of the Ant-Miner algorithm in terms of rule accuracy but are better in terms of rule simplicity.…”
Get full text
Get full text
Get full text
Get full text

A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules by Rizauddin, Saian

“…The second proposed algorithm uses SA to optimize the terms selection while constructing a rule. …”
Get full text
Get full text
Get full text
Get full text