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

Search alternatives:

Refine Results
  1. 1
    The division free parallel algorithm for finding determinant

    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
    Save to List
    Saved in:
  2. 2
    A new parallel model for starter sets generation via exchanging two elements

    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
    Save to List
    Saved in:
  3. 3
    Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network

    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
    Save to List
    Saved in:
  4. 4
    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network

    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
    Save to List
    Saved in:
  5. 5
    New Sequential and Parallel Division Free Methods for Determinant of Matrices

    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
    Save to List
    Saved in:
  6. 6
    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network

    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
    Save to List
    Saved in:
  7. 7
    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network

    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
    Save to List
    Saved in:
  8. 8
    Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks

    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
    Save to List
    Saved in:
  9. 9
    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem

    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
    Save to List
    Saved in:
  10. 10
    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions

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

    Published 2018
    “…The BOGS-BAT algorithm is based on three techniques. The first technique is to move or switch solution from single function to functions that contain more than one objective functions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A block cipher based on genetic algorithm

    A block cipher based on genetic algorithm by Zakaria, Nur Hafiza

    Published 2016
    “…In many algorithms which are based on the genetic algorithm approach, diffusion properties using crossover and mutation function are being generated to produce a secure data transmission. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    FaaSBid: an auction-based model for Function as a Service in edge-fog environments using unallocated resources

    FaaSBid: an auction-based model for Function as a Service in edge-fog environments using unallocated resources by Al-Qadhi, Abdulrahman K., Athauda, Rukshan, Latip, Rohaya, Hussin, Masnida

    Published 2026
    “…To initialise function placement, Fitness-Based Swap (FBSW) algorithm is proposed which places functions based on pre-defined information such as function size, function maximum execution time, and storage cost. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Computation of cryptosystem based on Lucas functions using addition chain

    Computation of cryptosystem based on Lucas functions using addition chain by Md Ali, Zulkarnain, Othman, Mohamed, Md. Said, Mohamad Rushdan, Sulaiman, Md. Nasir

    Published 2010
    “…Cryptosystem based on Lucas Functions is known as LUC Cryptosystem. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    An improved fast scanning algorithm based on distance measure and threshold function in region image segmentation

    An improved fast scanning algorithm based on distance measure and threshold function in region image segmentation by Ismael, Ahmed Naser

    Published 2016
    “…Hence, this study proposes an Improved Fast Scanning algorithm that is based on Sorensen distance measure and adaptive threshold function. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Enhancing speed performance of the cryptographic algorithm based on the lucas sequence

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

    Published 2003
    “…Utilizing the properties of Lucas functions introduced a public key system based on Lucas functions instead of exponentiation, which offer a good alternative to the most publicly used exponential public key system RSA. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Image encryption algorithm based on chaotic mapping

    Image encryption algorithm based on chaotic mapping by Salleh, Mazleena, Ibrahim, Subariah, Isnin, Ismail Fauzi

    Published 2003
    “…HVT function is based on a two-dimensional chaotic map that utilized Baker’s map algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    An efficient computation technique for cryptosystems based on Lucas functions

    An efficient computation technique for cryptosystems based on Lucas functions by Md Ali, Zulkarnain, Othman, Mohamed, Md. Said, Mohamad Rushdan, Sulaiman, Md. Nasir

    Published 2008
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms

    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
    “…Based on the results, the EP algorithm achieved a higher training rate and simple structure compared with the rest of the algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Biological-based semi-supervised clustering algorithm to improve gene function prediction

    Biological-based semi-supervised clustering algorithm to improve gene function prediction by Kasim, Shahreen, Deris, Safaai, M. Othman, Razib, Hashim, Rathiah

    Published 2011
    “…However, commonclustering algorithms do not provide a comprehensive approach that look into the three categories of annotations; biologicalprocess, molecular function, and cellular component, and were not tested with different functional annotation database formats.Furthermore, the traditional clustering algorithms use random initialization which causes inconsistent cluster generation and areunable to determine the number of clusters involved. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems

    Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

    Published 2018
    “…Therefore,it is of great interest that we find adjustments for these parameters in this research.There are two contributions to this research.The first one is having HMCR parameter using step function and the linear increase function while the second is applying the fret spacing concept on guitars that is associated with mathematical formulae is also applied in the BW parameter.There are three proposed models on the alteration of HMCR parameters based on the use of the fundamental step function;namely,the constant interval of step function, and its dynamic increase and decrease interval functions.The experimental results revealed that our proposed approach is superior to other state of the art harmony searches either in specific or generic cases. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: