Search Results - (( solution permutation based algorithm ) OR ( java application optimization algorithm ))

Refine Results
  1. 1

    A cylindrical coordinate system with dynamic permutation table for blowfish algorithm by Al-Abiachi, Ashwak M., Mahmod, Ramlan, Ahmad, Faudziah

    Published 2014
    “…The Blowfish Algorithm (BA) is a symmetric block cipher that iterates simple encryption and decryption functions by using Feistel networks.BA keys vary from 32-448 bits to ensure a high level of security.However, the BA requires a high memory percentage and it has a problem regarding randomness of output with text and image files having large strings of identical bytes.One solution to the seissues is to design a new Cryptography algorithm based on the BA that incorporates an F-function into a Cylindrical Coordinate System (CCS).The resulting F-function is known as a CCS with a Dynamic Permutation Table (DPT) or CCSDPT whereas the new algorithm is called the New BA (NBA).The objectives of the CCSDPT are to reduce memory requirements, enhance the randomness of the output and increase resistance to attacks through byte relocation and transformation in the right cylinder.NBA is evaluated by investigates the output of the algorithm by using statistical tests from the National Institute of Standard and Technology (NIST) with five types of data and compared with the BA.The findings of the NIST tests show that the NBA is suitable for any data stream, even those with long strings of identical bytes. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3
  4. 4

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

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

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

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8
  9. 9
  10. 10

    Fast ZeroY algorithm for efficient message routing in optical multistage interconnection networks by Raja Mohd Auzar, Tengku Dian Shahida, Othman, Mohamed, Abdullah, Mohamad Khazani

    Published 2008
    “…Based on the Zero algorithms, we proposed a fast and efficient crosstalk-free algorithm for message routing in optical Omega multistage networks. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…In order to establish an efficient mapping between the particle’s position in the continuous MOPSO and the scheduling solution in the JSP, this research proposes the JSP to be adopted within a discrete MOPSO through a modified solution representation using the permutation-based representation and a modified setup of the particle’s position and velocity. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14
  15. 15

    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
  16. 16
  17. 17

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

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

    Published 2022
    “…The results from the computational experiment indicated that the proposed PSO algorithm came out with the best solution in 10 out of the 15 test problems. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    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