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

Refine Results
  1. 1
  2. 2

    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
  3. 3

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  5. 5

    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
  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

    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
  8. 8

    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
  9. 9

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  10. 10

    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
  11. 11

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  15. 15

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  16. 16

    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
  17. 17

    Online food ordering application using Boyer-Moore algorithm / Muhammad Zulhilmie Dzulkifli by Dzulkifli, Muhammad Zulhilmie

    Published 2021
    “…With high precision, the Boyer-Moore algorithm will search faster. The future work of this project is to create further features that will make this app very successful.…”
    Get full text
    Get full text
    Thesis
  18. 18

    Automated tournament management system with dynamic matchmaking using genetic algorithm / Wan Muhammad Aqil Wan Harun by Wan Harun, Wan Muhammad Aqil

    Published 2016
    “…CTMS are embedded with dynamic match making using genetic algorithm that can pairs players based on variation combination of criteria such as player’s gender, points and nation. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Hereditary ratio of adolescent to parent based on lips analysis using canny edge detection / Nor Shamimi Kharuddin by Kharuddin, Nor Shamimi

    Published 2010
    “…It consists of several steps that make this method as an optimal edge detector. The objective of this research is gained from understanding of the problem statement. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Hybrid dynamic scheduling model for flexible manufacturing system with machine availability and new job arrivals by Paslar, Shahla

    Published 2015
    “…The BBO-VNS match-up algorithm manipulates the idle times on machines within the time horizon for assigning the affected operations by breakdown and/or newly arrived orders. …”
    Get full text
    Get full text
    Thesis