Search Results - (( parallel implementation matching algorithm ) OR ( parallel optimization method algorithm ))

Search alternatives:

Refine Results
  1. 1
    Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system

    Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system by Nurnajmin Qasrina Ann, Ayop Azmi

    Published 2018
    “…By implementing optimization algorithm in image template matching, it is expected that the computation time can be reduced. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    GPU-based odd and even hybrid string matching algorithm

    GPU-based odd and even hybrid string matching algorithm by Rahbari, Ghazal, Abdul Rashid, Nur’Aini, Husain, Wahidah

    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
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures

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

    Published 2020
    “…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Parallel batch self-organizing map on graphics processing unit using CUDA

    Parallel batch self-organizing map on graphics processing unit using CUDA by Daneshpajouh, H., Delisle, P., Boisson, J.-C., Krajecki, M., Zakaria, N.

    Published 2018
    “…The proposed implementation shown significant speedups of 11Ã� and 5Ã� compared to the sequential and parallel CPU implementations respectively. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Parallel batch self-organizing map on graphics processing unit using CUDA

    Parallel batch self-organizing map on graphics processing unit using CUDA by Daneshpajouh, H., Delisle, P., Boisson, J.-C., Krajecki, M., Zakaria, N.

    Published 2018
    “…The proposed implementation shown significant speedups of 11Ã� and 5Ã� compared to the sequential and parallel CPU implementations respectively. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    CUDA implementation of fractal image compression

    CUDA implementation of fractal image compression by Al Sideiri A., Alzeidi N., Al Hammoshi M., Chauhan M.S., AlFarsi G.

    Published 2023
    Article
    Save to List
    Saved in:
  9. 9
    Probabilistic ensemble fuzzy ARTMAP optimization using hierarchical parallel genetic algorithms

    Probabilistic ensemble fuzzy ARTMAP optimization using hierarchical parallel genetic algorithms by Loo, C.K., Liew, W.S., Seera, M., Lim, Einly

    Published 2015
    “…This was achieved by mitigating convergence in the genetic algorithms by employing a hierarchical parallel architecture. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Resource Minimization in a Real-time Depth-map Processing System on FPGA

    Resource Minimization in a Real-time Depth-map Processing System on FPGA by Ngo, Huy Tan, Hamid, Nor Hisham, Sebastian , Patrick, Yap, Vooi Voon

    Published 2011
    “…Depth-map algorithm allows camera system to estimate depth. It is a computational intensive algorithm, but can be implemented with high speed on hardware due to the parallelism property. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes

    Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes by Mohammad Sigit Arifianto, Tze, Kenneth Kin Teo, Liau, Chung Fan, Liawas Barukang, Zaturrawiah Ali Omar

    Published 2007
    “…Genetic Algorithm as one of the Evolutionary Computation method improve the execution of parallel programming codes by optimizing the number of processors and the distribution of data. …”
    Get full text
    Get full text
    Research Report
    Save to List
    Saved in:
  12. 12
    Improved black-winged kite algorithm and finite element analysis for robot parallel gripper design

    Improved black-winged kite algorithm and finite element analysis for robot parallel gripper design by Haohao, Ma, As’arry, Azizan, Yanwei, Feng, Lulu, Cheng, Delgoshaei, Aidin, Ismail, Mohd Idris Shah, Ramli, Hafiz Rashidi

    Published 2024
    “…This paper presents a comprehensive study on the design optimization of a robotic gripper, focusing on both the gripper modeling and the optimization of its parallel mechanism structure. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences

    A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences by M. Othman, Razib, Deris, Safaai, Md. IIlias, Rosli

    Published 2008
    “…The genetic similarity algorithm combines semantic similarity measure algorithm with parallel genetic algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems

    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
    Save to List
    Saved in:
  15. 15
    Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil

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

    Published 2014
    “…Examples of EC such as Genetic Algorithm (GA) and PSO (Particle Swarm Optimization) are prevalent due to their efficiency and effectiveness. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Distributed parallel deep learning with a hybrid backpropagation-particle swarm optimization for community detection in large complex networks

    Distributed parallel deep learning with a hybrid backpropagation-particle swarm optimization for community detection in large complex networks by Shing, Chiang Ta, Mohammed Al-Andoli, Mohammed Nasser, Wooi, Ping Cheah

    Published 2022
    “…Next, the method is integrated with two optimization algorithms: (1) backpropagation (BP), which optimizes deep learning locally within each local chunk of the CN; (2) particle swarm optimization (PSO), which is used to improve the BP optimization involving all CN chunks. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    PID Parameters Improvement for AGC in Three Parallel-Connected Power Systems

    PID Parameters Improvement for AGC in Three Parallel-Connected Power Systems by Mushtaq, Najeeb, Ramdan, Razali, K. G., Mohammed, Hamdan, Daniyal, Ali, M. Humada

    Published 2016
    “…The AGC loop is used to minimize the frequency deviation and control the power exchange in order to maintain them at their scheduled values due to the changes of the step-load disturbance. The optimal parameters of the PID scheme optimized by the proposed MS algorithm are compared with that one’s obtained by GA algorithm, and the proposed method has proven that its performance is more efficient and improved as well. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using asic design flow: article / Nurzaima Mahmod

    Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using asic design flow: article / Nurzaima Mahmod by Mahmod, Nurzaima

    “…The scope of this paper is to optimize the DNA sequences alignment on the matrix rilling module by implementing a parallel method of the Smith-Waterman algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Job Matching Mobile Application using Fuzzy Analytic Hierarchy Process (FAHP) / Mohammad Ashraf Jefrizin

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

    Published 2017
    “…FAHP is implemented in the job matching process. This project’s aim is to assist the job seekers to find ICT jobs that match to their preferences. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  20. 20
    Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using ASIC design flow / Nurzaima Mahmod

    Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using ASIC design flow / Nurzaima Mahmod by Mahmod, Nurzaima

    Published 2010
    “…The scope of this paper is to optimize the DNA sequences alignment on the matrix filling module by implementing a parallel method of the SmithWaterman algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: