Search Results - (( using function methods algorithm ) OR ( using permutation parallel algorithm ))

Refine Results
  1. 1

    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
  2. 2

    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
  3. 3

    Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network by Othman, Mohamed, Abdullah, Monir, Johari, Rozita

    Published 2008
    “…In this paper, a new parallel algorithm of the window method is developed called the Balanced Parallel Window Method (BPWM) algorithm. …”
    Get full text
    Get full text
    Article
  4. 4

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
  5. 5

    New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

    Published 2013
    “…The computation times in the newly developed sequential methods were dominated by generating starter sets. Therefore, two parallel strategies were developed to parallelise this algorithm so as to reduce the computation times. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

    Published 2007
    “…Under the constraint of avoiding crosstalk, the interests of these algorithms are to find a permutation that uses a minimum number of passes and minimum execution time. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

    Published 2005
    “…In Zero algorithms, there are three types of algorithms namely; The Zero X, Zero Y and zeroXY algorithms. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

    Published 2012
    “…Under the constraint of avoiding crosstalk, what we have been interested is how to realize a permutation that will use the minimum number of passes, the minimum execution time and the maximum bandwidth to route the input request to output without crosstalk. …”
    Get full text
    Get full text
    Thesis
  9. 9

    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

    Published 2023
    “…Flexible job shop scheduling problem (FJSP) is a common optimisation problem in the industry. The use of parallel machines allows an operation to be executed on a machine assigned from a set of alternative machines, raising a combination of machine assignment and job sequencing sub-problems. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Finding the root of nonlinear function using five bracketing method / Nur Afiqah Mohamed Azhar by Mohamed Azhar, Nur Afiqah

    Published 2019
    “…Therefore, numerical method in the form of bracketing method is often used to find only the approximate root of the function. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

    Published 2018
    “…The second technique is to solve bi-objective functions by using the BOBAT algorithm. The third technique is an integration of BOGSA with BOBAT to produce a BOGSBAT algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Determining the preprocessing clustering algorithm in radial basis function neural network by S.L. Ang, H.C. Ong, H.C. Law

    Published 2008
    “…Three types of method used in this study to find the centres include random selections, K-means clustering algorithm and also K-median clustering algorithm. …”
    Get full text
    Get full text
    Article
  13. 13

    Genetic Algorithms In Optimizing Membership Function For Fuzzy Logic Controller by Ismail, H. Muh Yusuf

    Published 2010
    “…Thus it is important to select the accurate membership functions but these methods possess one common weakness where conventional FLC use membership function and control rules generated by human operator. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin by Shamsudin, Siti Nur Hafiza

    Published 2019
    “…The global convergence result is established using exact line searches. Numerical result shows that algorithm 2 which is one of the proposed CG methods is more efficiency when compared to other algorithms.…”
    Get full text
    Get full text
    Thesis
  15. 15

    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

    Published 2018
    “…It shows that the IQR-HEOM method is more efficient to rectify the problem caused by using range in HEOM. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Fuzzy modeling using Bat Algorithm optimization for classification by Noor Amidah, Ahmad Sultan

    Published 2018
    “…As a result, the highest average accuracy generated which is 96.91% by using WBCD dataset. The average accuracy of Bat Algorithm is comparing with other methods. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  18. 18
  19. 19

    Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms by Alzaeemi, Shehab Abdulhabib, Tay, Kim Gaik, Huong, Audrey, Sathasivam, Saratha, Majahar Ali, Majid Khan

    Published 2023
    “…The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms, including Genetic Algorithm (GA), Evolution Strategy Algorithm (ES), Differential Evolution Algorithm (DE), and Evolutionary Programming Algorithm (EP). …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    The fusion of particle swarm optimization (PSO) and interior point method (IPM) as cooperative movement control algorithm in Swarm Robotics / Dada Emmanuel Gbenga by Dada Emmanuel, Gbenga

    Published 2016
    “…Secondly, we compared the performance of our new algorithm pdAPSO with APSO, and PSO using 7 benchmark functions. …”
    Get full text
    Get full text
    Thesis