Search Results - parallel reduction new algorithm

A Parallel new high order iterative algorithm on shared memory multiprocessors parallel computer by Mohamed Othman, Abdul Rahman Abdullah

“…This algorithm shows drastic reduction in execution time as compared to the standard high-order points iterative algorithm. …”
Get full text
Get full text
Get full text

Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

“…Results show that these new sequential and parallel algorithms run faster than the standard sequential and parallel FDTD algorithms. …”
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

Parallel implementation of complexity reduction approach to fourth order approximation on 2D free space wave propagation. by Hasan, Mohammad Khatim, Othman, Mohamed, Abbas, Zulkifly, Sulaiman, Jumat, Ahmad, Fatimah

“…In this paper we solve 2D wave propagation problems on a Symmetrical Multiprocessor machine using message-passing interface. We examine the parallelism efficiency of the algorithm by analyzing the simulation time and speedup. …”
Get full text
Get full text

Enhancing speed performance of the cryptographic algorithm based on the lucas sequence by M. Abulkhirat, Esam

“…Reducing the calculation time of the algorithm, in sequential and parallel platforms, using the doubling-rule technique combined with a new scheme led to a strong improvement of the LUC algorithm speed. …”
Get full text
Get full text

Parallel Diagonally Implicit Runge-Kutta Methods For Solving Ordinary Differential Equations by Din, Ummul Khair Salma

“…Three large scales of stiff ODEs are used to measure the parallel performances of the new embedded methods. …”
Get full text
Get full text

Block Multistep Methods for Solving Ordinary Differential Equations by Ibrahim, Zarina Bibi

“…Finally, this thesis deals with parallel numerical algorithms for the solution of systems of ODEs. …”
Get full text
Get full text

New methods of partial transmit sequence for reducing the high peak-to-average-power ratio with low complexity in the ofdm and f-ofdm systems by Abduljabbar, Yasir Amer

“…Third, a new hybrid method that combines the Selective mapping and Cyclically Shifts Sequences (SLM-CSS-PTS) techniques in parallel has been proposed for improving the PAPR reduction performance and the computational complexity level. …”
Get full text
Get full text
Get full text
Get full text

Computationally efficient sequential learning algorithms for direct link resource-allocating networks by Asirvadam , Vijanth Sagayan, McLoone, Sean, Irwin, George W

“…The new algorithms, which also incorporate a pruning strategy to control network growth, are evaluated on three different system identification benchmark problems and shown to outperform existing methods both in terms of training error convergence and computational efficiency.…”
Get full text
Get full text

Design and development of high performance swa cell design for local DNA sequence alignment by Syed Abdul Rahman, Syed Abdul Mutalib Al Junid

“…This study proposed three new DNA sequence alignment accelerator system cell design and architecture based on the Smith-Waterman Algorithm (SWA) named as the new Optimized SWA Linear Gap Penalty (OSL), Optimized SWA Affine Gap Penalty (OSA), and Optimized Recursive Variable Expansion SWA Linear Gap Penalty (ORSL). …”
Get full text
Get full text

Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks by Moudi, Mehrnaz

“…This algorithm has been developed to achieve performance goals in terms of 50% reduction in the number of passes.…”
Get full text
Get full text

Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

“…The first task is to introduce a new rough model for minimum reduct selection and default rules generation, which is known as a Twofold Integer Programming (TIP). …”
Get full text
Get full text

Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method by Ashraf Saleh Mohammad Alomoush

Scheduling dynamic cellular manufacturing systems in the presence of cost uncertainty using heuristic method by Delgoshaei, Aidin

“…Since the proposed models (like similar models in the literature) are likely to fall into local optimum points, a Branch and Bound based heuristic, a hybrid Simulated Annealing and Genetic algorithm, a hybrid Tabu search and Simulated Annealing, a hybrid Genetic algorithm and Simulated Annealing, a hybrid Ant Colony Optimization and Simulated Annealing and a hybrid Multi-layer Perceptron and Simulated Annealing algorithms are developed. …”
Get full text
Get full text