Search Results - (( making problem matching algorithm ) OR ( java application optimization algorithm ))

Refine Results
  1. 1
  2. 2

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Instance matching framework for heterogeneous semantic web content over linked data environment by Mansir, Abubakar

    Published 2021
    “…Manual parameter configuration is another problem associated to existing matching frameworks, which make them weak in handling data with high level of heterogeneity. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Performance analysis of coalition formation algorithms based on matching theory for cognitive radio networks by Tahir, Mohammad, Habaebi, Mohamed Hadi, Islam, Md. Rafiqul

    Published 2017
    “…For coalition formation using matching theory, we analyze two algorithms, namely Gale-Shapely algorithm and one-sided stable matching algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  5. 5

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  6. 6

    Malay cuisine cooking recipe recommendation system using Genetic Algorithm (GA) / Nur Nazihah Ismail by Ismail, Nur Nazihah

    Published 2017
    “…However, there are a few problems exists by using current system such as it is does not match with the available ingredients that user have. …”
    Get full text
    Get full text
    Student Project
  7. 7
  8. 8

    Job Matching Mobile Application using Fuzzy Analytic Hierarchy Process (FAHP) / Mohammad Ashraf Jefrizin by Jefrizin, Mohammad Ashraf

    Published 2017
    “…Conventionally, hiring process does not apply preferences such as criteria to choose the best candidate for the vacancies. Job matching is an innovative method in hiring process to solve this problem. …”
    Get full text
    Get full text
    Student Project
  9. 9

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Weighted Sum Method (WSM) is one of the weighting methods to solve the multi criteria decision making problems (MCDM). In order to achieve the objective, Weighted Sum-Dijkstra’s Algorithm (WSDA), a combination method between WSM and Dijkstra’s Algorithm is applied to solve multiple criteria network problems. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11

    Disparity map algorithm for stereo matching process using local based method by Gan, Melvin Yeou Wei

    Published 2022
    “…The proposed SVDM algorithm involves four stages which starts from matching cost computation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14
  15. 15

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Bee foraging behaviour techniques for grid scheduling problem by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

    Published 2006
    “…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis