Search Results - parallel satisfaction a algorithm*

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

“…A membership function is associated with each job, which describes the degree of satisfaction with respect to completion time of the job. …”
Get full text

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

“…Patient scheduling in operating theatres (OT) involves high costs to hospitals and may affect treatment and satisfaction to patients. Scheduling for patients in parallel OT can help to schedule a large number of patients and emergency patients are considered in this study .Other than that, emergency patients are able to be scheduled and treated on the day as the modification of schedule is performed during the dynamic processof scheduling. …”
Get full text
Get full text

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

“…Scheduling problem (that is assigning resources and t ime points to given tasks) arise in many real-world domains, for example reservation environment. A reservation environment typically refers to a parallel -machine with n jobs available for processing. …”
Get full text
Get full text
Get full text

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

“…It describes a new scheduling approach, which is a combination of an updated conservative backfilling approach further optimised by the raccoon optimisation algorithm. …”
Get full text
Get full text

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

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

Adaptive resource allocation for reliable performance in heterogeneous distributed systems. by Hussin, Masnida, Abdullah, Azizol, K. Subramaniam, Shamala

Get full text

Efficient Numerical Modelling of Extreme Wave by Tan , Vi Nie

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

Efficient Numerical Modelling of Extreme Waves by Tan, Vi Nie

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