Search Results - (( parallel evaluation method algorithm ) OR ( problem application based algorithm ))*

Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

“…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
Get full text
Get full text

Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs. by Ismail, Fudziah, Siri, Zailan, Othman, Mohamad, Suleiman, Mohamed

“…Diagonally Implicit Runge-Kutta (DIRK) methods are amongst the most useful and cost-effective methods for solving initial value problems but the dependency of the functions evaluations on the previous functions evaluations makes DIRK method not so favourable for parallel computers. …”
Get full text
Get full text

A spark-based parallel fuzzy C median algorithm for web log big data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Nizamuddin, Mohammed Khaja, Sarkar, Rashal, Chalil, Aboosalih Kakkat

“…Based on the Rand Index and SSE (sum of squared error), the parallel Fuzzy C median algorithm's performance is evaluated in the PySpark platform. …”
Get full text
Get full text
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…MEMPHA, a hypergraphs-based model, aims to aspire to the challenge by providing topology modelling of the target parallel machine and application modelling of the parallel application, which is hypergraph-based model, to abstract the details of HPAs. …”
Get full text
Get full text

A review of the parallel algorithms for solving multidimensional PDE problems by Alias, Norma, Islam, Md. Rajibul

Get full text
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

Minimizing machining airtime motion with an ant colony algorithm by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

Get full text
Get full text

Solving ordinary differential equations using block multistep method by Mehrkanoon, Siamak

“…The parallelism across the system is considered for the implementation of the parallel block methods. …”
Get full text
Get full text

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

“…Findings of this project is portrayed as conceptual framework that consists the structure of job matching mobile application using FAHP algorithm. Evaluation is conducted using accuracy test where the result of this application is compared to the manual method using a survey. …”
Get full text
Get full text

Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

“…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
Get full text
Get full text

Parallel Execution of Runge-Kutta Methods for Solving Ordinary Differential Equations by Siri, Zailan

“…The method used here is actually have been tailored made for the purpose of parallel machine where the subsequent functions evaluations do not depend on the previous function evaluations. …”
Get full text
Get full text

Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure by Asbullah, Muhammad Asyraf

“…We also evaluate the memory cost for system parameters and accumulators. …”
Get full text
Get full text

Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

“…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
Get full text
Get full text

Enhancing performance of XTS cryptography mode of operation using parallel design by Ahmed Alomari, Mohammad

“…In addition, the parallel XTS mode was also simulated using Twofish and RC6 encryption algorithms. …”
Get full text
Get full text

Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision by Abu Raid, Fadi Imad Osman

“…These algorithms are then parallelized using Compute Unified Device Architecture CUDA C language to run on Graphics Processing Unit GPU for hardware acceleration. …”
Get full text
Get full text

Communication and computational cost on parallel algorithm of PDE elliptic type by Alias, Norma

“…Due to this needs, this paper presents the parallel performance evaluations of algorithms that will be discussed in term of communication and computational cost.…”
Get full text
Get full text

A Distributed Memory Parallel Fourth-Order IADEMF Algorithm by Mansor N.A., Zulkifle A.K., Alias N., Hasan M.K.

Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

“…MR is an emerging parallel processing framework that hides the complex parallelization processes by employing the functional abstraction of "map and reduce" The Performance of the parallelized GA via MR and PSO via MR are evaluated using an analogous case study to find out the speedup and efficiency in order to measure the scalability of both proposed algorithms. …”
Get full text
Get full text

Simulating Electrohydrodynamic Ion-Drag Pumping on Distributed Parallel Computing Systems by Shakeel Ahmed, Kamboh, Zubair, Ahmed Kalhoro, Kashif, Ali Abro, Jane, Labadin

“…For that reason, a Data Parallel Algorithm for EHD model (DPA-EHD) is designed. …”
Get full text
Get full text
Get full text

The Parallel Fuzzy C-Median Clustering Algorithm Using Spark for the Big Data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Siddiqui, Sumrana, Sarkar, Rashel

“…Therefore, we develop a Parallel Fuzzy C-Median Clustering Algorithm Using Spark for Big Data that can handle large datasets while maintaining high accuracy and scalability. …”
Get full text
Get full text
Get full text
Get full text