Search Results - (( java implementation among algorithm ) OR ( knowledge solution means algorithm ))

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

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text

A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

“…A simulator for desktop grid environment has been developed using Java as the implementation language due to its wide popularity. …”
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…”

Network game (Literati) / Chung Mei Kuen by Chung, Mei Kuen

“…The main aspect of this thesis is to produce a networked gaming system, which process players. requested to play the game and enabling users to play the graphical game with people through the network. The algorithm design and implementation method must not only be workable, but also highly efficient in terms of execution speed and response time. …”
Get full text
Get full text

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

Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

“…These algorithms mostly built upon the partitioning k-means clustering algorithm. …”
Get full text
Get full text

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

“…CS and JA have implemented in the same platform (Intellij IDEA Community Edition 2020.2.3) using the same language (Java). …”
Get full text
Get full text
Get full text
Get full text

Hyper-heuristic approaches for data stream-based iIntrusion detection in the Internet of Things by Hadi, Ahmed Adnan

“…In addition, it is considered that existing solutions do not provide a feature driftaware solution to the concept drift adaptable solution, which exploits the fact that many of the original features are non-relevant. …”
Get full text
Get full text

Tacit knowledge for business intelligence framework using cognitive-based approach by Surbakti, Herison

“…Tacit knowledge becoming a key issue in business intelligence approach to knowledge systems. …”
Get full text
Get full text

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

“…Fuzzy Logic Controllers (FLCs) are considered as knowledge-based systems, incorporating human knowledge. …”
Get full text
Get full text

Towards a better feature subset selection approach by Shiba, Omar A. A.

“…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
Get full text
Get full text
Get full text

Network monopoly / Tan Kean Yeap by Tan , Kean Yeap

“…The main aspect of this thesis is to produce a network monopoly system, which process multiple game sessions concurrently, enabling users to play the graphical game with people within the network. The algorithm design and implementation method mustnot only be workable, but also highly efficient in terms of execution speed and respond time. …”
Get full text
Get full text

Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

“…Many algorithms have been implemented to solve the grid scheduling problem. …”
Get full text
Get full text
Get full text

Enhancing Performance of Batik SMEs through Cleaner Production Adoption: Insights from Clustering Algorithm Analysis by Achmad, Fandi, Zulkarnain, Ibnu, Rumanti, Augustina Asih, Wiratmadja, Iwan Inrawan, Shuhidan, Shuhaida Mohamed

Get full text
Get full text

Average concept of crossover operator in real coded genetic algorithm by Abd Rahman, Rosshairy, Ramli, Razamin

“…As the most important search operator in a Genetic Algorithm (GA) approach, many procedures have been proposed to accomplish the idea of a crossover.As a result, knowledge in crossover has incorporated special features such as statistical elements (i.e. arithmetic crossover) and natural observation (i.e. queen bee crossover) to name a few.Thus, this paper proposed a mean or average concept of crossover for finer parents to produce a new offspring in a GA based approach in an animal diet formulation problem.Experiments using real data were carried out involving GA models with average crossover and one-point crossover.Subsequently, the incorporation of power heuristics as a repair operator was investigated to find the best combination of ingredients, while removing the unwanted ones.Comparisons were made between GA models incorporating repair operator with different crossovers: average crossover and one point crossover.The results show that the performance of average crossover is comparable with that of the one point crossover.The inclusion of the repair operator provides an advantage that shows interesting solution for the tested problem.…”
Get full text
Get full text
Get full text

The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning by Noor, Ubair, Hassan, Raini, Dwi Handayani, Dini Oktarina

“…The preliminary results using the K means Clustering Algorithm showed that the conceptual framework successfully grouped similar data points, facilitating the identification of skyline points. …”
Get full text
Get full text
Get full text
Get full text

Solving New Student Allocation Problem (NSAP) with Analytical Hierarchy Process (AHP) by Wan Hussin, Wan Haniza, Shibghatullah, Abdul Samad, Shahbodin, Faaizah

“…The problem is the students are allocated to their class randomly, just by using their registration number and by all means without referring to their intelligence level, knowledge, skills and also their performance. …”
Get full text
Get full text

Smart student timetable planner by Wong, Xin Tong

“…To achieve these objectives, the system adopts the Rapid Application Development (RAD) methodology, ensuring iterative design, prototyping, and user feedback integration throughout the process. The system is implemented using Node.js with Express for server-side development, HTML, CSS, and JavaScript for the frontend, and Socket.IO for real-time collaboration. …”
Get full text
Get full text

Solving New Student Allocation Problem (NSAP) With Analytical Hierarchy Process (AHP) by Shahbodin, Faaizah, Wan Hassim, Wan Haniza, Shibghatullah, Abdul Samad

“…There are many approaches used to solve New Student Allocation Problem (NSAP).Many researchers use application of Genetic Algorithm (GA).However,the study presented in this paper applies an Analytical Hierarchy Process (AHP)technique in solving New Student Allocation Problem (NSAP) handled by Registration Unit at Ungku Omar Polytechnic.The problem is the students are allocated to their class randomly,just by using their registration number and by all means without referring to their intelligence level,knowledge,skills and also their performance.So,in this paper the researcher’s focus is on solving NSAP by using AHP to allocate students into their respective classes with minimum intelligence gap in each class and the number of students in each class does not exceed its maximum capacity.The proposed solution will be tested using real data from the Politeknik Ungku Omar to see the result. …”
Get full text
Get full text
Get full text
Get full text