Search Results - parallel satisfaction ((use algorithm) OR (tree algorithm))

Search alternatives:

  • Showing 1 - 5 results of 5
Refine Results
  1. 1
    GPU-based odd and even hybrid string matching algorithm

    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
    Save to List
    Saved in:
  2. 2
    Local search approaches for patient scheduling problem in parallel operating theatre

    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
    Save to List
    Saved in:
  3. 3
    Development of appoinment scheduling agent using distributed constraint satisfaction (DisCS)

    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
    “…A reservation environment typically refers to a parallel -machine with n jobs available for processing. …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  4. 4
    Efficient Numerical Modelling of Extreme Wave

    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
    Save to List
    Saved in:
  5. 5
    Efficient Numerical Modelling of Extreme Waves

    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
    Save to List
    Saved in:

Search Tools: