Search Results - (( problem ((using tree) OR (using three)) algorithm ) OR ( java application testing algorithm ))

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

Classification System for Heart Disease Using Bayesian Classifier by Magendram, Anusha

“…This is a new approach that able to use by doctors to rectify the heart problem. This system was developing base on to three main part which is data processing, testing and implementation of the algorithm. …”
Get full text
Get full text

A Model for Evaluation of Cryptography Algorithm on UUM Portal by Norliana, Abdul Majid

“…The methodology used in this study begun with problem identification, requirement identification, analysed the model process and design the simulation model. …”
Get full text
Get full text
Get full text

Developing an intelligent system to acquire meeting knowledge in problem-based learning environments by Chiang, A., Baba, M.S.

“…Similarly, the algorithm proposed in MALESAbrain can, be used to deal, the problem of conducting a meeting among learners to solve problems. …”
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

“…The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text

Input-output based relation combinatorial testing using whale optimization algorithm for generating near optimum number of test suite by Suali, Anjila J., Nuraminah Ramli, Rozmie Razif Othman, Hasneeza Liza Zakaria, Iszaidy Ismail, Nor Shahida Mohd Jamail, Rimuljo Hendradi, Nurol Husna Che Rose

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 resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
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

Securing cloud data system (SCDS) for key exposure using AES algorithm by Thabet Albatol, Mohammed Samer Hasan

“…The AES algorithm has its own structure to encrypt and decrypt sensitive data that make the attackers difficult to get the real data when encrypting by AES algorithm. …”
Get full text
Get full text
Get full text
Get full text

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

“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.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.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text

Classification of breast cancer disease using bagging fuzzy-id3 algorithm based on fuzzydbd by Nur Farahaina, Idris

“…One of the most powerful machine learning methods to handle classification problems is the decision tree. There are various decision tree algorithms, but the most commonly used are Iterative Dichotomiser 3 (ID3), CART, and C4.5. …”
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

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

Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

“…Secondly, an expert system using Java programming technology with two tiers of search engine was developed to perform a fast selection of candidate materials in huge volume. …”
Get full text
Get full text

Winsorize tree algorithm for handling outliers in classification problem by Ch’ng, Chee Keong

Get full text
Get full text
Get full text

Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem by Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad

“…In this paper we proposed three algorithms by modifying Kruskal’s and Prim’s algorithms. …”
Get full text
Get full text
Get full text

Comparison of Gradient Boosting Decision Tree Algorithms for CPU Performance by Haithm Haithm, ALSHARI, Abdulrazak Yahya, Saleh, Alper, ODABAŞ

“…We divide the performance criteria into four: accuracy, speed, reliability, and ease of use. The performance of the three algorithms has been tested with five classification and regression problems. …”
Get full text
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

“…Recent industrial solutions to overcome the problem includes using manual registration, using 125kHz proximity card, using mobile application to scan QR code and others. …”
Get full text
Get full text
Get full text

Interval elimination method for stochastic spanning tree problem by Mohd, Ismail

“…The optimum spanning tree problem has been well considered and until now several powerful algorithms have been proposed. …”
Get full text
Get full text
Get full text

Parsing algorithms for grammars with regulated rewriting by Turaev, Sherzod, Othman, Mohamed, Selamat, Mohd Hasan, Krassovitskiy, Alexander

“…In this paper, we show that the parsing problem for regulated grammars can be solved by means of Petri net derivation trees constructed using the net unfolding. …”
Get full text
Get full text
Get full text
Get full text

A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Rahim At Samsuddin, H. A., Ab. Rahman, A. A. H., Andaljayalakshmi, G., Ahmad, R. B.

Get full text
Get full text