Search Results - (( java implementation case algorithm ) OR ( problem using function algorithm ))

Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo

“…To help engineers select the best metaheuristic algorithms for their problems, there is a need to evaluate the performance of different metaheuristic algorithms against each other using common case studies. …”
Get full text
Get full text
Get full text
Get full text

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

“…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
Get full text
Get full text
Get full text

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
Get full text
Get full text

Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework by Asaad Aref, Ibrahim

Get full text
Get full text

Pairwise testing tools based on hill climbing algorithm (PTCA) by Lim, Seng Kee

“…The actual implementation of the algorithm which is in Java programming language, the program is implemented on Net Bean 7.0.1. …”
Get full text
Get full text

Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

Get full text
Get full text

Java based expert system for selection of natural fibre composite materials by Ahmed Ali, Basheer A., Salit, Mohd Sapuan, Zainudin, Edi Syams, Othman, Mohamed

“…In this paper, we develop a technology for the materials selection system using Java based expert system. The weighted-range method (WRM) was implemented to identify the range value and to scrutinise the candidate materials. …”
Get full text
Get full text
Get full text

Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

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.

“…According to the simulation results, the proposed algorithm produces the best solution among all algorithms in the proposed cases. � 2021 Little Lion Scientific…”

SANAsms: Secure short messaging system for secure GSM mobile communication by Anuar, N.B., Azlan, I.M., Wahid, A.W.A., Zakaria, O.

“…The system is developed using Java 2 Micro Edition (J2ME) which is written in Java. …”
Get full text
Get full text

Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

“…Later, this algorithm was used to solve bi-objective Production Planning (PP) and Scheduling Problem (Sch.P). …”
Get full text
Get full text

An efficient method for determining all the extreme points of function with one variable by Pandiya, Ridwan

“…The algorithm is directly suitable for a class of problems of commonly used in solving the global optimization problems. …”
Get full text

Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…One classical engineering problem known as the welded beam structure problem is used to test the proposed LSMA algorithm's efficacy. …”
Get full text
Get full text
Get full text

Optimization of mycelium growth using genetic algorithm for multi-objective functions by Muhamad Faiz, Abu Bakar

“…Mathematical optimization was typical use for such problem, in which it was supposed to maximizing or minimizing a function. …”
Get full text
Get full text
Get full text

Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text

Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

“…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
Get full text
Get full text

Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network by Ismail Abdullah, Kalid Abdlkader Marsal

Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…We took advantage of Levy flight, which solved the local optima problem and improved traditional TSA efficiency. The proposed LTSA algorithm performance was evaluated using 23 well-known benchmark test functions, namely unimodal benchmark functions, multimodal benchmark functions, and fixed-dimension multimodal benchmark functions, as well as compared with the traditional TSA. …”
Get full text
Get full text
Get full text

New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

“…Job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
Get full text
Get full text

Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems by Zulkifli, Munierah, Abd Rahmin, Nor Aliza, Wah, June Leong

“…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
Get full text
Get full text
Get full text