Search Results - (( process permutation based algorithm ) OR ( java application using 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
    “…However, in the new algorithm, this process is replaced by factorial numbers. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Improved Watermarking Algorithm Based on Discrete Wavelet Transform and Fibonacci Permutation by Salem Hussin, Saleh Hussin

    Published 2005
    “…This algorithm is based on the combination of Fibonacci permutation and discrete wavelet transforms (DWT). …”
    Get full text
    Get full text
    Thesis
  5. 5

    Permutation entropy based full-reference image quality qssessment by Baqar, Mohtashim *, Lau, Sian Lun *, Mansoor Ebrahim

    Published 2019
    “…Motivated by the need of appropriate objective models, we propose a novel objective IQA algorithm, namely, Permutation Entropy Deviation Index (PEDI), based on the working principle of permutation entropy (PE). …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach by Bareduan, Sallehahmad, Hasan, Sulaiman

    Published 2010
    “…This paper presents makespan algorithms and scheduling heuristic for an Internet-based collaborative design and manufacturing process using bottleneck approach. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

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

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

    Published 2016
    “…In this research, we proposed a new block cipher algorithm based on genetic algorithm approach which shall meet the security requirements. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by N. A., Isa, S. A., Bareduan, A. S., Zainudin, M., Marsudi

    Published 2021
    “…This study used the bottleneck-based approach to identify the critical processing machine which led to high completion time. …”
    Get full text
    Get full text
    Article
  12. 12

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by Isa, N.A., Bareduan, S.A., Zainudin, A.S., Marsudi, M.

    Published 2021
    “…This study used the bottleneck-based approach to identify the critical processing machine which led to high completion time. …”
    Get full text
    Get full text
    Article
  13. 13

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by Isa, N.A., Bareduan, S.A., Zainudin, A.S., Marsudi, M.

    Published 2021
    “…This study used the bottleneck-based approach to identify the critical processing machine which led to high completion time. …”
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
    Get full text
    Get full text
    Final Year Project
  16. 16
  17. 17

    Bottleneck-based heuristic for permutation flowshop scheduling by Isa, Noor Amira

    Published 2017
    “…The newly heuristic is developed by introducing the bottleneck-based concept that was applied at the beginning of initial solution determination. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Development of DNA-based dynamic key-dependent block cipher by Saeed, Auday H.

    Published 2015
    “…The thesis identifies the similarity elements, and highlights the essential computation elements, namely the DNA-strands, DNA-bases, Central dogma process that can be applied in symmetric block cipher that fulfills Shannon’s confusion and diffusion properties. …”
    Get full text
    Get full text
    Thesis
  20. 20

    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