Search Results - (( _ processing (problems OR problem) algorithm ) OR ( java applications based algorithm ))
Search alternatives:
- applications based »
- java applications »
- processing »
-
1
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…The proposed algorithm can overcome stagnation problem, minimize processing time, match jobs with suitable resources, and balance entire resources in grid environment. …”
Get full text
Get full text
Get full text
Thesis -
2
Application of genetic algorithm and JFugue in an evolutionary music generator
Published 2025“…This project explores the application of Genetic Algorithms (GA) with JFugue, which is a Java-based music programming library to develop an Evolutionary Music Generator. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
3
Classification System for Heart Disease Using Bayesian Classifier
Published 2007“…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
Thesis -
4
Direct approach for mining association rules from structured XML data
Published 2012“…Even though it makes use of the existing technology, this approach is often time consuming and involves manual intervention because of the mapping process. The focus of this study is to propose an enhancement on memory consumption by reducing the number of candidates generated for the existing FLEX algorithm which will reduce the amount of memory needed to execute the algorithm. …”
Get full text
Get full text
Thesis -
5
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…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. …”
Get full text
Get full text
Get full text
Monograph -
6
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Offloading heavy data size to a remote node introduces the problem of additional delay due to transmission. Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text
Article -
7
Message based random variable length key encryption algorithm.
Published 2009“…None fixed size key caused avoidance of replaying and other attacks that can happen on fixed sized key algorithms. Conclusion: Random process employed in this block cipher increased confidentiality of the message and dynamic length substitution in proposed algorithm may lead to maximum cryptographic confusion and consequently makes it difficult for cryptanalysis.…”
Get full text
Get full text
Article -
8
Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde
Published 2022“…Studies have shown how user perception can have a strong influence on policies and decision-making processes in a place, society, and nation. This thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
Get full text
Get full text
Get full text
Thesis -
9
Object-Oriented Programming semantics representation utilizing agents
Published 2011“…Generally, these source codes go through the preprocessing, comparison, extraction, generate program semantics and classification processes. A formal algorithm that can be applied to any two related Java-based source codes examples is invented to generate the semantics of these source codes. …”
Get full text
Get full text
Get full text
Article -
10
Resource management in grid computing using ant colony optimization
Published 2011“…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
Monograph -
11
Automated time series forecasting
Published 2011“…Moving Average, Decomposition, Exponential Smoothing, Time Series Regressions and ARIMA) were used.The algorithm was developed in JAVA using up to date forecasting process such as data partition, several error measures and rolling process.Successfully, the results of the algorithm tally with the results of SPSS and Excel.This automatic forecasting will not just benefit forecaster but also end users who do not have in depth knowledge about forecasting techniques.…”
Get full text
Get full text
Get full text
Monograph -
12
Web-based expert system for material selection of natural fiber- reinforced polymer composites
Published 2015“…Finally, the developed expert system was deployed over the internet with central interactive interface from the server as a web-based application. As Java is platform independent and easy to be deployed in web based application and accessible through the World Wide Web (www), this expert system can be one stop application for materials selection.…”
Get full text
Get full text
Thesis -
13
Development of mobile application of event assistant and booking sport facilities for UiTM Seremban 3 Campus using wofkflow management system / Ahmad Haiqal Abd Halim, Ahmad Yusuf...
Published 2019“…The manual processes for applying an event at UiTM Seremban 3 take several steps and day to get an approval. …”
Get full text
Get full text
Student Project -
14
Web-based RIG performance reporting system using interactive visualization techniques / Amir Hambaly Nasaruddin
Published 2019“…This project software development process used an agile model SDLC to develop the system. …”
Get full text
Get full text
Thesis -
15
RSA Encryption & Decryption using JAVA
Published 2006“…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
Get full text
Get full text
Final Year Project -
16
Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
Published 2015“…Flow shop scheduling problems relates the generation of appropriate sequencing for processing of N machines in compliance with given processing sequence orders. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
DEVELOPMENT OF A MULTI-OBJECTIVE OPTIMZATION FRAMEWORK FOR INDUSTRIAL PROCESSES
Published 2014“…Thus, this work focuses on industrial MO problems encountered in process engineering with more than two objectives. …”
Get full text
Get full text
Thesis -
18
Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach
Published 2014“…The process sequencing problem can be modeled as the travelling salesman problem with precedence constraints (TSPPC). …”
Get full text
Get full text
Get full text
Article -
19
Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim
Published 2012“…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
Get full text
Get full text
Thesis -
20
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
Published 2018“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Article
