Search Results - (( job application need algorithm ) OR ( web application means algorithm ))

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

“…The K-means algorithm has been around for over a century. …”
Get full text
Get full text

A modified π rough k-means algorithm for web page recommendation system by Zidane, Khaled Ali Othman

“…Web page recommendation system is an application of Web Usage Mining (WUM) approach, which specializes in predicting the user next browsing activity in real-time Web for personalized recommendations. …”
Get full text
Get full text
Get full text

A Hybrid Approach For Web Search Result Clustering Based On Genetic Algorithm With K-means by Norita Md Norwawi, Bourair Al-attar, Ahmed J. Allami, Ali Thoulfikar A. Imeer, Yusor Fadhil Alasadi, Hawraa M. Kadhim

Get full text

Independent And Dependent Job Scheduling Algorithms Based On Weighting Model For Grid Environment by M. Al-Najjar, Hazem

Get full text
Get full text

Web based clustering tool using K-MEAN++ algorithm / Muhammad Nur Syazwanie Aznan by Aznan, Muhammad Nur Syazwanie Aznan

“…Which is why this project objective is to develop a web based clustering tool using K-MEAN++ algorithm. …”
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

Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid by Lorpunmanee, Siriluck, Md Sap, Mohd Noor, Abdullah, Abdul Hanan

“…Our model presents the method of the jobs classifications based mainly on Fuzzy C-Mean algorithm and mapping the jobs to the appropriate resources based mainly on Genetic algorithm. …”
Get full text
Get full text

Survey on job scheduling mechanisms in grid environment by S. M., Argungu, Che Mohamed Arif, Ahmad Suki, Omar, Mohd Hasbullah

“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
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

Job recruiting system using sorting Algorithm / Adi Asyraf Ayob by Ayob, Adi Asyraf

“…The sorting algorithm will assist the recruiters in selecting best job candidate by assigning score to each applicants and sort the applicant list by the finest score value. …”
Get full text
Get full text

Impatient job scheduling under cloud computing by Mahdi, Nawfal A.

“…The limitations of those algorithms were addressed and this leads to the proposition of an algorithm that has the ability to map the impatient jobs to virtual machines near its input, output, application, or forth party. …”
Get full text
Get full text

Resource management in grid computing using enhanced ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza, Abdul Nasir, Husna Jamal

Get full text
Get full text

Big Data Mining Using K-Means and DBSCAN Clustering Techniques by Fawzia Omer, A., Mohammed, H.A., Awadallah, M.A., Khan, Z., Abrar, S.U., Shah, M.D.

“…The density-based spatial clustering of applications with noise (DBSCAN) and the K-means algorithm were used to develop clustering algorithms. …”
Get full text
Get full text

INCENTIVE-SCHEDULING ALGORITHMS TO PROVIDE GREEN COMPUTATIONAL DATA CENTER by HARUNA, AHMED ABBA

Get full text
Get full text

Enhanced ant colony optimization for grid resource scheduling by Abdul Nasir, Husna Jamal, Ku-Mahamud, Ku Ruhana

Get full text
Get full text

Towards developing a web application with text filtering for FTMSK : A case study for electronic exchange board / Sumardi Shukor by Shukor, Sumardi

Get full text
Get full text

Pattern Discovery Using K-Means Algorithm by Ahmed, AM, Norwawi, NM, Ishak, WHW, Alkilany, A

Adaptive Hybrid Blood Cell Image Segmentation by Muda, TZT, Salam, RA, Ismail, S

Route planner mobile web application for UiTM Malaysia / Suzana Ahmad ... [et al.] by Ahmad, Suzana, Mat Diah, Norizan, Mohamad Kamal, Nor Ashikin, Mohd Jailani, Siti Zalekha

“…A Route Planner Mobile Web Application for UiTM Malaysia has been developed to produce a list of routes from two selected points in order of the shortest first. …”
Get full text
Get full text
Get full text

A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

“…In the case of large setup time, jobs tend to form a large batch size with more jobs in a batch to reduce the need of setup time between batches from different families. …”
Get full text