Search Results - parallel satisfaction ((level algorithm) OR (_ algorithm))

  • Showing 1 - 8 results of 8
Refine Results
  1. 1

    Local search approaches for patient scheduling problem in parallel operating theatre by Alimin, Nur Neesha

    Published 2020
    “…In the first phase, pre-processing stage, combination of pre-processing stage with low-level heuristic and genetic algorithm are used.The different types of LS are applied in the second phase of scheduling. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Development of appoinment scheduling agent using distributed constraint satisfaction (DisCS) by Mohd. Azmi, Nurulhuda Firdaus, Eri, Zeti Darleena, Ibrahim, Nuzulha Khilwani, Ahmad Rusli, Rozana Diana

    Published 2008
    “…In the other hand, to improve a better operation system level in organization. In this study, several algorithms were produced for different types of appointment policies and constraints. …”
    Get full text
    Get full text
    Get full text
    Monograph
  3. 3

    Scheduling Problem with Fuzzy Due-dates on Unrelated Parallel Processors by Kanesan , Muthusamy, Ishii, Hiroaki

    Published 2000
    “…We propose an efficient algorithm for this problem. (Abstract by authors)…”
    Get full text
    Conference or Workshop Item
  4. 4

    GPU-based odd and even hybrid string matching algorithm by Rahbari, Ghazal, Abdul Rashid, Nur’Aini, Husain, Wahidah

    Published 2016
    “…String matching is considered as one of the fundamental problems in computer science.Many computer applications provide the string matching utility for their users, and how fast one or more occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    ROA-CONS: raccoon optimization job scheduling by Koohi, Sina Zangbari, Abdul Hamid, Nor Asilah Wati, Othman, Mohamed, Ibragimov, Gafurjan

    Published 2021
    “…An optimised schedule results in greater efficiency of the parallel machine. In addition, processes and network heterogeneity is another difficulty for the scheduling algorithm. …”
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Efficient Numerical Modelling of Extreme Wave by Tan , Vi Nie

    Published 2020
    “…Future works will be carried out to study the parallelization of the algorithm to allow for larger problem size to be treated.…”
    Get full text
    Get full text
    Final Year Project
  8. 8

    Efficient Numerical Modelling of Extreme Waves by Tan, Vi Nie

    Published 2020
    “…Future works will be carried out to study the parallelization of the algorithm to allow for larger problem size to be treated.…”
    Get full text
    Get full text
    Final Year Project