Search Results - parallel generation ((a algorithm) OR (_ algorithm))

Refine Results
  1. 1

    A permutation parallel algorithm under exchange restriction with message passing interface by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2014
    “…The sequential algorithm is implemented to a parallel algorithm by integrating with Message Passing Interface (MPI) libraries by paralleling the starter sets generation task.The speedup and efficiency is the indicator tool for analyzing performance of this parallel algorithm.The results show reduction time computation of parallel algorithm among processors.…”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Parallel Processing of RSAAlgorithm Using MPI Library by Wan Dagang, Wan Rahaya

    Published 2006
    “…The end result of this project is a parallel algorithm of RSA cryptosystem. v…”
    Get full text
    Get full text
    Final Year Project
  3. 3

    Analysing and improving the performance and security of the cryptographically Generated Address (CGA) algorithm for mobile IPv6 networks by Qadir, Sana, Siddiqi, Mohammad Umar, Al-Khateeb, Khalid A. Saeed

    Published 2015
    “…A Cryptographically Generated Address (CGA) is a self-certifying address that a node can generate when it joins a foreign network. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2013
    “…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems by Karimi, Abbas, Zarafshan, Faraneh, Jantan, Adznan, Ramli, Abdul Rahman, Saripan, M. Iqbal, Syed Mohamed, Syed Abdul Rahman Al-Haddad

    Published 2012
    “…To resolve the problem associated with sequential plurality voter in dealing with large number of inputs, this paper introduces a new generation of plurality voter based on parallel algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Scalable workflow scheduling algorithm for minimizing makespan and failure probability by Abdul Aziz, Maslina, Ninggal, Izuan Hafez

    Published 2019
    “…A workflow generator was developed to generate large task graphs randomly and scheduled the parallel applications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Parallel strategy for starter sets to list all permutation based on cycling restriction by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar

    Published 2011
    “…This paper presents a parallel implementation of a new permutation generation method.This permutation generation method is based on the starter sets for listing all the n! …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Parallelization of speech compression based algorithm based on human auditory system on multicore system by Gunawan, Teddy Surya, Kartiwi, Mira, Khalifa, Othman Omran

    Published 2012
    “…The objective of this research is to develop and implement a novel parallel speech compression algorithm based on human auditory system on a multicore system. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Parallelization of prime number generation using message passing interface by I.A., Aziz, N.S., Haron, T.J., Low, R., Wan, D., Wan

    Published 2008
    “…In this research, we propose a parallel processing algorithm that runs on cluster architecture suitable for prime number generation. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm by Al-Jumaili A.H.A., Muniyandi R.C., Hasan M.K., Singh M.J., Paw J.K.S., Al-Jumaily A.

    Published 2025
    “…The results showed that using canopy as a preprocessing step cut the time it proceeds to deal with the significant number of power load abnormalities found in parallel using a fast density peak dataset and the time it proceeds for the k-means algorithm to run. …”
    Article
  12. 12

    Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad by Saima Gulzar, Ahmad

    Published 2017
    “…Eventually, the workflow is executed. The second algorithm is a variation in first algorithm in which data parallelism is introduced in each partition. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

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

    Published 2018
    “…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
    Thesis
  14. 14

    The visualization of three dimensional brain tumors' growth on distributed parallel computer systems by Alias, Norma, Masseri, Mohd. Ikhwan Safa, Islam, Md. Rajibul, Khalid, Siti Nurhidayah

    Published 2009
    “…A comparison of sequential and parallel algorithm will be discussed and this study will address the major issues of the parallel computers performance in terms of efficiency, effectiveness, speedup, and temporality.…”
    Get full text
    Get full text
    Article
  15. 15

    PMT : opposition based learning technique for enhancing metaheuristic algorithms performance by Hammoudeh, S. Alamri

    Published 2020
    “…Considering only one direction can be problematic as the best solution may come in any of a multitude of directions. Addressing these OBL limitations, this research proposes a new general OBL technique inspired by a natural phenomenon of parallel mirrors systems called the Parallel Mirrors Technique (PMT). …”
    Get full text
    Get full text
    Thesis
  16. 16

    Distributed generation with parallel connected inverter by Younis, U.A.A., Rahirn, N.A., Mekhilef, Saad

    Published 2009
    “…This paper presents the design and analysis of a new configuration of parallel connected inverter suitable for Distributed Generation Application. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    PMT: opposition-based learning technique for enhancing meta-heuristic performance by Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2019
    “…Addressing these issues, this research proposes a new general opposition-based learning (OBL) technique inspired by a natural phenomenon of parallel mirrors systems called the parallel mirrors technique (PMT). …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    A new parallel model for starter sets generation via exchanging two elements by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2019
    “…In this study, a technique of parallelization across the method was employed to develop new parallel algorithm for finding all permutations under exchanged restrictions. …”
    Get full text
    Get full text
    Article
  19. 19

    Flexible job shop scheduling using priority heuristics and genetic algorithm by Farashahi, Hamid Ghaani

    Published 2010
    “…Experimental results over all instances indicated that the most work remaining rule with earliest completion time rule (MWKR-ECT) and earliest completion time rule (ECT) achieved the minimum of makespan up to 65% and 34% of all instances in comparison with other proposed heuristic procedures. In the next method, a genetic algorithm has been developed. It has been shown that proposed genetic algorithm with a reinforced initial population (GA2) has better efficiency compared to a proposed genetic algorithm with fully random initial population (GA0). …”
    Get full text
    Get full text
    Thesis
  20. 20

    Web based personalized university timetable for UiTM students using genetic algorithm / Mohd Radhi Fauzan Jamli and Ahmad Firdaus Ahmad Fadzil by Jamli, Mohd Radhi Fauzan, Ahmad Fadzil, Ahmad Firdaus

    Published 2024
    “…Within the genetic algorithm framework, each timetable is represented as a chromosome, forming a population of potential timetables refined through successive generations by genetic operators like crossover and mutation. …”
    Get full text
    Get full text
    Get full text
    Article