Search Results - (( based permutation parallel algorithm ) OR ( java application optimized 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
    “…Permutations. However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducing the computation time. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    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
    “…permutations.The sequential algorithm is developed and parallelized for parallel computing by integrating with Message Passing Interface (MPI) libraries. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

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

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

    Published 2013
    “…The research also aims to generalise the Sarrus Rule for any order of square matrices based on permutations which are derived using starter sets. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

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

    Published 2007
    “…Finally Four Heuristic and Difference Increasing and Decreasing routing algorithms based on bitwise operation are established. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8
  9. 9

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  10. 10

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

    Published 2005
    “…The experiments conducted have proven that the proposed algorithms are effective and efficient. They are based on routing algorithms to minimize the number of passes to route all the inputs to outputs without crosstalk. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13

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

    Published 2023
    “…Given a wide range of MAR-JSR permutations, selecting a suitable MAR-JSR pair for a FJSP becomes a challenge. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15
  16. 16

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

    Published 2006
    “…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis