Search Results - (( process permutation generation algorithm ) OR ( java implication based 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

    Comparison between starter sets generation method for listing all permutations by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni

    Published 2013
    “…Listing of all n! distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation by Karim, Sharmila, Ibrahim, Haslinda

    Published 2021
    “…Case is demonstrated for a new algorithm for lexicographic order permutation. In conclusion, this new development is only applicable for generating starter sets as a lexicographic order permutation due to factorial numbers is applicable for lexicographic order permutation…”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    New recursive circular algorithm for listing all permutations by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar, Suleiman, Mohamed

    Published 2014
    “…Linear array of permutations is hard to be factorized.However, by using a starter set, the process of listing the permutations becomes easy. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    New recursive circular algorithm for listing all permutations by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar, Suleiman, Mohamed

    Published 2014
    “…Linear array of permutations is hard to be factorised. However, by using a starter set, the process of listing the permutations becomes easy. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    A new parallel model for starter sets generation via exchanging two elements by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2019
    “…It was found that the process of generating permutations requires lengthy time. …”
    Get full text
    Get full text
    Article
  7. 7
  8. 8
  9. 9

    Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop by Ziao, C.Z., Kamaruddin, S.

    Published 2015
    “…Permutation flow shop problem (PFSP) is one of the important subclass of scheduling, where the order in each process remains unchanged for all machines. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Key schedule algorithm based on coordinate geometry of a three-dimensional hybrid cube by Mushtaq, Muhammad Faheem

    Published 2019
    “…A key schedule algorithm is the mechanism that generates and schedules all session-keys for the encryption process. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems by Chong, Zheng Ziao

    Published 2015
    “…The order sequence for each process remains unchanged for all machines. Few algorithms have been developed to decide the sequence of n jobs and m machines that can minimize makespan in flow shops. …”
    Get full text
    Get full text
    Thesis
  12. 12

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

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…The algorithm was tested on 15 test problems where between 10 to 150 holes were randomly generated. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Optimization of job scheduling in a machine shop using genetic algorithm by Adhikari, A., Biswas, C.K., Adhikari, N.

    Published 2002
    “…As job scheduling involves allocation of jobs to machines to reduce the idle time of machines, the aim of this work emphasises on minimizing the cycle time by using genetic algorithm (GA). Each job has a pre-determined process sequence and the sequences are decided according to metal cutting theory and technological constraints. …”
    Get full text
    Get full text
    Article
  15. 15

    Optimization of job scheduling in a machine shop using genetic algorithm by Adhikari, A., Biswas, C.K., Adhikari, N.

    Published 2002
    “…As job scheduling involves allocation of jobs to machines to reduce the idle time of machines, the aim of this work emphasises on minimizing the cycle time by using genetic algorithm (GA). Each job has a pre-determined process sequence and the sequences are decided according to metal cutting theory and technological constraints. …”
    Get full text
    Get full text
    Article
  16. 16

    Current trends strategies in the test redundancy reduction by Norasyikin, Safieny, Kamal Z., Zamli, Hasneeza, L. Zakaria

    Published 2016
    “…To enhance the performance by using a metaheuristic algorithm, we are proposing our work with adopts the sequence permutation and hybridization strategies.…”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Efficient dynamic DNA-based block cipher algorithm by Chng, Chern Wei

    Published 2023
    “…The ShiftRow operation in this system, which is based on DNA, operates as a pseudo-random number generator. It generates encrypted random numbers for the encryption process. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Simulated Annealing Based Strategy for Test Redundancy Reduction by Kamal Z., Zamli, Mohd Hafiz, Mohd Hassin, Al-Kazemi, Basem, Naseer, Atif

    Published 2014
    “…Unlike existing works which rely on the Greedy approaches, our work adopts the random sequence permutation and optimization algorithm based on Simulated Annealing with systematic merging technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Towards a unified image quality assessment technique for cross-content image processing applications by Baqar, Mohtashim *

    Published 2024
    “…The rise in consumer electronics has led to the daily generation of massive multimedia signals. To make efficient multimedia processing systems, understanding human perception is crucial. …”
    Get full text
    Thesis
  20. 20