Search Results - (( job application ((means algorithm) OR (tree algorithm)) ) OR ( _ application based algorithm ))

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

A Data Mining Approach to Construct Graduates Employability Model in Malaysia by Myzatul Akmam Sapaat, Aida Mustapha, Johanna Ahmad, Khadijah Chamili, Rahamirzam Muhamad

Get full text

A data mining approach to construct graduates employability model in Malaysia by Sapaat, Myzatul Akmam, Mustapha, Aida, Ahmad, Johanna, Chamili, Khadijah, Muhamad, Rahamirzam

Get full text
Get full text
Get full text

Adaptive intelligence job online scheduling within dynamic grid environment based on gridsim by Lorpunmanee, Siriluck, Md. Sap, Mohd. Noor, Abdullah, Abdul Hanan

Get full text
Get full text

Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line by Noroziroshan, Alireza, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah

Get full text
Get full text
Get full text

A comparative representation approach to modern heuristic search methods in a job shop by Dominic P, Dhanapal Durai, Ahmad, Kamil, Parthiban, P, Lenny Koh, SC

Get full text
Get full text

Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem by Abdelraheem Elhaj, Hazir Farouk

Get full text
Get full text
Get full text

Home service mobile application based on matching algorithm / Mohammad Naqib Norbaini by Norbaini, Mohammad Naqib

Get full text
Get full text

Content-based recommender system for an academic social network / Vala Ali Rohani by Vala Ali, Rohani

“…The algorithm exploits all interests and preferences in a hierarchy tree structure. …”
Get full text
Get full text

Dynamic replication aware load blanced scheduling in distributed environment / Said Bakhshad by Said Bakhshad, Bakhshad

“…We propose a novel dynamic Replication Aware Load Balanced Scheduling (DRALBS) algorithm, that considers the replica location dynamically at the time of the scheduling of the job. …”
Get full text
Get full text
Get full text

MRI segmentation of medical images using FCM with initialized class centers via genetic algorithm by Balafar, Mohammad Ali, Ramli, Abdul Rahman, Saripan, M. Iqbal, Mahmud, Rozi, Mashohor, Syamsiah, Balafar, Hakimeh

“…This article introduced a new method based on the combination of genetic algorithm and FCM to solve this problem. …”
Get full text
Get full text

Jobs Visualization and Salary Prediction System Based on Jobstreet Malaysia / Khyrina Airin Fariza Abu Samah ... [et al.] by Abu Samah, Khyrina Airin Fariza, Wirakarnain, Nurqueen Sayang Dinnie, Deraman, Noor Afni, Johari, Siti Nor Amalina, Moketar, Nor Aıza, Hasrol Jono, Mohd Nor Hajar

“…The extracted Jobstreet’s data runs the pre-processing, develops the model, and runs on real-world data. Linear Regression algorithm was used to predict the salary and tested using mean absolute error to validate the prediction. …”
Get full text
Get full text

A static jobs scheduling for independent jobs in Grid Environment by using Fuzzy C-Mean and Genetic algorithms by Lorpunmanee, Siriluck, Md. Sap, Mohd. Noor, Abdullah, Abdul Hanan, Srinoy, Surat

Get full text
Get full text

Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol by Sjaugi, Muhammad Farhan

Get full text
Get full text

Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

“…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
Get full text
Get full text

Deploying clustered wireless sensor network by multi-robot system by Arezoumand, Reza, Mashohor, Syamsiah

“…In this method robots act as dispenser for wireless nodes. Using spanning tree as exploration algorithm helps robot to full coverage deployment of nodes. …”
Get full text
Get full text

Multi objective bee colony optimization framework for grid job scheduling by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.Job scheduling problem is one of the key issues because of high heterogeneous and dynamic nature of resources and applications in the grid computing environment.Bee colony approach has been used to solve this problem because it can be easily adapted to the grid scheduling environment.The bee algorithms have shown encouraging results in terms of time and co st.In this paper a framework for multi objective bee colony optimization is proposed to schedule batch jobs to available resources where the number of jobs is greater than the number of resources.Pareto analysis and k-means analysis are integrated in the bee colony optimization algorithm to facilitate the scheduling of jobs to resources.…”
Get full text
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

Detection of sweetness level for fruits (watermelon) with machine learning by Wan Nazulan, Wan Nurul Suraya, Asnawi, Ani Liza, Mohd Ramli, Huda Adibah, Jusoh, Ahmad Zamani, Ibrahim, Siti Noorjannah, Mohamed Azmin, Nor Fadhillah

Get full text
Get full text
Get full text
Get full text

Checkpointing in selected most fitted resource task scheduling in grid computing by Latip, Rohaya, Lew, Wai San, Chanchary, Fara Habib

“…Results show that with MeanFailureCP-SMF has reduce the average execution time (AET) compare to the current SMF and MeanFailure Algorithm.…”
Get full text
Get full text