Search Results - (( parallel evaluation method algorithm ) OR ( problem application a algorithm ))
Search alternatives:
- problem application »
- evaluation method »
- method algorithm »
- application a »
- a algorithm »
-
1
Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems
Published 2018“…This thesis studies multiobjective UTSP consisting of frequency setting, timetabling, simultaneous bus and driver scheduling by applying Multiple Tabu Search (MTS) algorithm. Metaheuristic methods have been widely applied to solve UTSP which is a NP-hard problem. …”
Get full text
Get full text
Thesis -
2
-
3
Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs.
Published 2009“…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
Article -
4
Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures
Published 2020“…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
Get full text
Get full text
Thesis -
5
A spark-based parallel fuzzy C median algorithm for web log big data
Published 2022“…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
Article -
6
GPU-based odd and even hybrid string matching algorithm
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 -
7
Efficient 3D temperature propagation for laser glass interaction
Published 2008“…The performance evaluations of the algorithm are increasing in terms of speed-up, efficiency and effectiveness.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
8
An improved parallel AGE method to solve incomplete blow-up problem through high performance computing system
Published 2010“…We propose a new variance of the Alternating Group Explicit Scheme (AGE) algorithms to solve incomplete blow-up problem through High performance computing (HPC). …”
Get full text
Get full text
Get full text
Article -
9
Solving ordinary differential equations using block multistep method
Published 2011“…The parallelism across the system is considered for the implementation of the parallel block methods. …”
Get full text
Get full text
Thesis -
10
Minimizing machining airtime motion with an ant colony algorithm
Published 2016Get full text
Get full text
Article -
11
Process Planning Optimization In Reconfigurable Manufacturing Systems
Published 2008“…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
Thesis -
12
Diffusion and statistical analysis of STITCH-256
Published 2023“…Hash function is an important cryptographic primitive used in a wide range of applications, for example, for message authentication and in digital signatures. …”
Article -
13
Job Matching Mobile Application using Fuzzy Analytic Hierarchy Process (FAHP) / Mohammad Ashraf Jefrizin
Published 2017“…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
Student Project -
14
Parallel Execution of Runge-Kutta Methods for Solving Ordinary Differential Equations
Published 2004“…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
Thesis -
15
Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems
Published 2014“…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
Get full text
Get full text
Thesis -
16
Enhancing performance of XTS cryptography mode of operation using parallel design
Published 2009“…In addition, the parallel XTS mode was also simulated using Twofish and RC6 encryption algorithms. …”
Get full text
Get full text
Thesis -
17
Communication and computational cost on parallel algorithm of PDE elliptic type
Published 2009“…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
Book Section -
18
Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure
Published 2015“…We also evaluate the memory cost for system parameters and accumulators. …”
Get full text
Get full text
Thesis -
19
-
20
Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil
Published 2014“…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
Thesis
