Search Results - (( job application system algorithm ) OR ( web application ((kano algorithm) OR (bat algorithm)) ))

Refine Results
  1. 1

    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm by Muhammad Syahril Mohamad Sainal

    Published 2022
    “…This research will conduct comparison of hybrid Genetic Algorithm and Bat Algorithm (GA-BA) with Genetic Algorithm (GA) and Bat Algorithm (BA). …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
  2. 2
  3. 3
  4. 4
  5. 5

    Job position prediction based on skills and experience using machine learning algorithm / Ezaryf Hamdan by Hamdan, Ezaryf

    Published 2024
    “…Accessible through a desktop application, the Job Position Prediction System prioritizes userfriendliness for job seekers. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2020
    “…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
    Thesis
  7. 7

    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

    Published 2012
    “…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
    Monograph
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15

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

    Published 2012
    “…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
    Thesis
  16. 16
  17. 17

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

    Published 2012
    “…Thus, overall aim of this research is to introduce new grid scheduling algorithms for resource allocation as well as for job scheduling for enabling a highly efficient and effective utilization of the resources in executing various applications. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19
  20. 20

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

    Published 2015
    “…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
    Article