Search Results - (( parallel implementation level algorithm ) OR ( parallel optimization path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision

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

    Published 2021
    “…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
    Thesis
    Save to List
    Saved in:
  2. 2
    Tool path generation of contour parallel based on ant colony optimisation

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Minimizing machining airtime motion with an ant colony algorithm

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

    Published 2016
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Parallel Implementation of Two Level Barotropic Models Applied to the Weather Prediction Problem

    Parallel Implementation of Two Level Barotropic Models Applied to the Weather Prediction Problem by Bahri, Susila

    Published 2004
    “…To process the data collected from British Atmospheric Data Centre (BADC), the sequential programs in row and columnwise fashions are developed and implemented. Then the parallel algorithms are constructed and run using the Beowulf Cluster machine. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM

    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM by Zain Ali, Noohul Basheer, Noras, James

    Published 2001
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Implementation of High Speed Large Integer Multiplication Algorithm on Contemporary Architecture

    Implementation of High Speed Large Integer Multiplication Algorithm on Contemporary Architecture by Chang, Boon Chiao

    Published 2018
    “…We are able to eliminate the bottleneck, the CRT algorithm from our previous implementation by replacing it with another level of CTFNT and hence increased the multiplication operand size to 4096, 192K, 384K and 768K-bit.In our FPGA implementation, we focused on designing the processing unit ourselves that is capable of computing 3072-bit multiplication. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  7. 7
    An improved RSA cryptosystem based on thread and CRT / Saheed Yakub Kayode and Gbolagade Kazeem Alagbe

    An improved RSA cryptosystem based on thread and CRT / Saheed Yakub Kayode and Gbolagade Kazeem Alagbe by Yakub Kayode, Saheed, Kazeem Alagbe, Gbolagade

    Published 2017
    “…Java programming language is used to implement the algorithm. Experimental results indicate that as the thread level increases, the encryption and decryption time, which is the most time consuming operation, decreases which shows an improved speed of the RSA cryptosystem.The proposed implementation has a great potential to effectively deal with the RSA algorithm slow speed.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    The AGEB algorithm for solving the heat equation in three space dimensions and its parallelization using PVM

    The AGEB algorithm for solving the heat equation in three space dimensions and its parallelization using PVM by Sahimi M.S., Alias N., Sundararajan E.

    Published 2023
    “…It is inherently explicit and is therefore well suited for parallel implementation on the PVM where data decomposition is run asynchronously and concurrently at every time level. …”
    Conference Paper
    Save to List
    Saved in:
  9. 9
    The AGEB Algorithm for Solving the Heat Equation in Three Space Dimensions and Its Parallelization Using PVM

    The AGEB Algorithm for Solving the Heat Equation in Three Space Dimensions and Its Parallelization Using PVM by Sahimi, Mohd Salleh, Alias, Norma, Sundararajan, Elankovan

    Published 2001
    “…It is inherently explicit and is therefore well suited for parallel implementation on the PVM where data decomposition is run asynchronously and concurrently at every time level. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Parallel and Separable Recursive Levenberg- Marquardt Training Algorithm

    Parallel and Separable Recursive Levenberg- Marquardt Training Algorithm by Asirvadam , Vijanth Sagayan, McLoone, Sean, Irwin, George

    Published 2002
    “…By neglecting interneuron weight correlations the recently proposed RLM training algorithm can be decomposed at neuron level enabling weights to be updated in an efficient parallel manner. …”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  11. 11
    The AGEB Algorithm for Solving the Heat Equation in Three Dimensions and Its Parallelization Using PVM

    The AGEB Algorithm for Solving the Heat Equation in Three Dimensions and Its Parallelization Using PVM by Sahimi, Mohd Salleh, Alias, Norma, Sundarajan, Elankovan

    Published 2001
    “…It is inherently explicit and is therefore well suited for parallel implementation on the PVM where data decomposition is run asynchronously and concurrently at every time level. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    An embedded database design and implementation of a parallel IEEE XTS storage encryption for mobile devices

    An embedded database design and implementation of a parallel IEEE XTS storage encryption for mobile devices by Alomari, Mohammad Ahmed Mohammad

    Published 2017
    “…To ensure higher security level, the developed system is implemented using the NIST-certified XTS-AES block encryption algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Implementation of Parallel K-Means Algorithm to Estimate Adhesion Failure in Warm Mix Asphalt

    Implementation of Parallel K-Means Algorithm to Estimate Adhesion Failure in Warm Mix Asphalt by Akhtar, M.N., Ahmed, W., Kakar, M.R., Bakar, E.A., Othman, A.R., Bueno, M.

    Published 2020
    “…The results showed that the PKIP algorithm decreases the execution time up to 30 to 46 if compared with the sequential k means algorithm when implemented using multiprocessing and distributed computing. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Voting algorithms for large scale fault-tolerant systems

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Design and analysis of high performance and low power matrix filling for DNA sequence allignment accelerator using ASIC design flow / Nurul Farhana Abd Razak

    Design and analysis of high performance and low power matrix filling for DNA sequence allignment accelerator using ASIC design flow / Nurul Farhana Abd Razak by Abd Razak, Nurul Farhana

    Published 2010
    “…The objective of this paper is to improve the performance of the DNA sequence alignment and to optimize power reduction of the existing technique by using Smith Waterman (SW) algorithm. The scope of study is by using the matrix filling method which is in parallel implementation of the SmithWaterman algorithm. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  17. 17
    Parallel strategies on a distributed parallel computer system

    Parallel strategies on a distributed parallel computer system by Alias, Norma

    Published 2004
    “…The development of a few strategies parallel is being as a mechanism for IADE to make it implemented in parallel. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  18. 18
    Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance.

    Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance. by Mohammad Alkhatib, Jaafar, Azmi, Md Said, Mohamad Rushdan, Ahmad Zukarnain, Zuriati

    Published 2012
    “…The best performance level was achieved when parallelizing Montgomery ECC computations to eight parallel multipliers (PM) using homogeneous coordinates. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance.

    Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance. by Alkhatib, Mohammad, Jaafar, Azmi, Md Said, Mohamad Rushdan, Ahmad Zulkarnain, Zuriati

    Published 2013
    “…The best performance level was achieved when parallelizing Montgomery ECC computations to eight parallel multipliers (PM) using homogeneous coordinates. …”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  20. 20
    Conjunctions in biological neural architectures for visual pose estimation / Tom´As Maul

    Conjunctions in biological neural architectures for visual pose estimation / Tom´As Maul by Tom´As, Maul

    Published 2006
    “…At the algorithmic level, several approaches for solving the pose estimation problem are compared in terms of their neural implementability. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: