Search Results - (( java implementation mining algorithm ) OR ( using functional scheduling algorithm ))

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

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

“…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
Get full text
Get full text
Get full text

Scalable approach for mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

“…Many techniques have been proposed to tackle the problem of mining XML data we study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
Get full text

Mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

“…Many techniques have been proposed to tackle the problem of mining XML data. We study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
Get full text

A web-based implementation of k-means algorithms by Lee, Quan

“…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
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 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

Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

“…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular 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 research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
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

DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS by MEHMOOD SHAH, SYED NASIR

“…The issue is not only to develop new algorithms, but also to evaluate them on an experimental computational grid, using synthetic and real workload traces, along with the other existing job scheduling algorithms. …”
Get full text
Get full text

Development of multi-objective optimization methods for integrated scheduling of handling equipment (AGVs, QCs, SP-AS/RS) in automated container terminals by Homayouni, Seyed Mahdi

“…Therefore, two meta-heuristic algorithms, namely genetic algorithm (GA) and simulated annealing (SA) algorithm, were developed to optimize the integrated scheduling of handling equipment. …”
Get full text
Get full text

Improving utility accrual scheduling algorithm for adaptive real-time system by Ahmad, Idawaty, Othman, Mohamed, Ahmad Zukarnain, Zuriati, Othman, Muhammad Fauzan

“…In this paper, we proposed a preemptive utility accrual scheduling (or PUAS) algorithm to further extend the functionalities of General Utility Scheduling (or GUS) algorithm proposed by Peng Li [1]. …”
Get full text
Get full text

Exam hall allocation using genetic algorithm / Norisyani Binti Fauzai by Fauzai, Norisyani

“…In this project an automated exam hall allocation prototype was developed using the genetic algorithm since this algorithm is commonly used to produce high-quality optimization solutions. …”
Get full text
Get full text

Sports tournament scheduling using genetic algorithm / Hafeezur Syakir Abdul Motok@Mohd Ridzuan by Abdul Motok@Mohd Ridzuan, Hafeezur Syakir

“…The functionality testing is conducted using Blackbox testing technique to test the functionality of the project.…”
Get full text
Get full text

Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

“…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
Get full text
Get full text
Get full text
Get full text

Space allocation for examination scheduling using Genetic Algorithm / Alya Kauthar Azman by Azman, Alya Kauthar

“…The system generates and evaluates potential schedules using fitness functions, selection, crossover, and mutation operators to iteratively improve scheduling efficiency. …”
Get full text
Get full text

FaaSBid: an auction-based model for Function as a Service in edge-fog environments using unallocated resources by Al-Qadhi, Abdulrahman K., Athauda, Rukshan, Latip, Rohaya, Hussin, Masnida

“…Next, the Dynamic Demand Replacement Algorithm (DDRA) algorithm is used to place in-demand functions near the edge nodes periodically, while the proposed task scheduling algorithm - Maximum Revenue Bid (MRB) is used to give priority to tasks to maximise revenue near the edge. …”
Get full text
Get full text
Get full text

A Non-preemptive Utility Accrual Scheduling Algorithm in iAdaptive Real Time System by Ahmad, Idawaty, Othman, Muhammad Fauzan

“…We consider the independent task models that are subject to deadline constraints specified using step Time/Utility Functions (or TUFs). The main idea of our proposed algorithm is to reduce the unnecessary abortions by eliminating the greedy scheduling decision identified in GUS. …”
Get full text
Get full text

An Optimal Scheduling Controller for Virtual Power Plant and Microgrid Integration Using the Binary Backtracking Search Algorithm by Abdolrasol M.G.M., Hannan M.A., Mohamed A., Amiruldin U.A.U., Abidin I.B.Z., Uddin M.N.

Maintenance staff scheduling system using heuristic-greedy algorithm / Nurliyana Sabli by Sabli, Nurliyana

“…The scheduling part will be developed using heuristic – greedy algorithm. …”
Get full text
Get full text

A preemptive utility accrual scheduling algorithm in adaptive real time system. by Ahmad, Idawaty, Subramaniam, Shamala, Othman, Mohamed, Othman, Muhammad Fauzan

“…In this paper, we propose a preemptive utility accrual scheduling(or PUAS) algorithm as an enhancement to General Utility Scheduling ( or GUS) algorithm proposed by Peng Li [1]. …”
Get full text
Get full text