Search Results - (( using function ((a algorithm) OR (new algorithm)) ) OR ( using codification based algorithm ))

Refine Results
  1. 1

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

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

    Published 2018
    “…The second technique is to solve bi-objective functions by using the BOBAT algorithm. The third technique is an integration of BOGSA with BOBAT to produce a BOGSBAT algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

    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
    “…We have evaluated the FaaSBid model and the proposed algorithms and pricing model by comparing with a number of existing models and algorithms using real-world datasets. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    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
    “…We have found that the binary sequence used in a new algorithm is shorter than a special sequence used in an existing algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Comparison between Genetic Algorithm and Prey-Predator Algorithm. by Ong, Hong Choon

    “…We introduce a new metaheuristic algorithm inspired by prey-predator interaction of animals. …”
    Get full text
    Monograph
  6. 6

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

    Published 2003
    “…Reducing the calculation time of the algorithm, in sequential and parallel platforms, using the doubling-rule technique combined with a new scheme led to a strong improvement of the LUC algorithm speed. …”
    Get full text
    Get full text
    Thesis
  7. 7

    New heuristic function in ant colony system for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…However, one part of the algorithm, called heuristic function, is not updated at any time throughout the process to reflect the new information discovered by the ants.This paper proposes an Enhanced Ant Colony System algorithm for solving the Travelling Salesman Problem.The enhanced algorithm is able to generate shorter tours within reasonable times by using accumulated values from pheromones and heuristics.The proposed enhanced ACS algorithm integrates a new heuristic function that can reflect the new information discovered by the ants. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

    Published 2012
    “…Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Designing New Block Cipher Based On Genetic Algorithm Approach by Nur Hafiza Binti Zakaria, Ramlan Mahmod, Nur Izura Udzir, Zuriati Ahmad Zukarnain, Suriyani Ariffin

    Published 2024
    “…In this research, we proposed a new block cipher algorithm based on genetic algorithm approach which shall meet the security requirements. …”
    Article
  10. 10

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

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
  12. 12

    Assessing the symbiotic organism search variants using standard benchmark functions by Nurul Asyikin, Zainal, Fakhrud, Din, Kamal Z., Zamli

    Published 2019
    “…In this paper, we present a new version of SOS by looping the current algorithm rather than doing it one after the other. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Adaptive differential evolution algorithm with fitness based selection of parameters and mutation strategies / Rawaa Dawoud Hassan Al-Dabbagh by Rawaa Dawoud Hassan, Al-Dabbagh

    Published 2015
    “…Secondly, a new DE algorithm (ARDE-SPX) is introduced that automatically adapts a repository of DE strategies and parameters control schemes to avoid the problems of stagnation and make DE respond to a wide range of function characteristics at different stages of evolutionary search. …”
    Get full text
    Get full text
    Thesis
  14. 14

    A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations by Mohd Ali, Fakariah Hani

    Published 2004
    “…The new approach algorithm speed increment has consistently increased in between 18% to 22% microsecond for encryption and 30% to 34% for decryption compared to Rijndael algorithm.…”
    Get full text
    Get full text
    Thesis
  15. 15

    Improved combined mutation clonal selection algorithm by Paw J.K.S., Hen C.K., Yan K.W., Ann Y.S.

    Published 2023
    “…The new and improved algorithm was tested using various unimodal and multimodal test functions to illustrate the improvements of the algorithm. …”
    Conference paper
  16. 16

    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
    “…New technique shows a smaller computation time compared to the existing algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17
  18. 18

    Optimization of modified Bouc–Wen model for magnetorheological damper using modified cuckoo search algorithm by Rosmazi, Rosli, Zamri, Mohamed

    Published 2021
    “…The newly proposed algorithm was tested using a set of standard benchmark functions with different searching space and global optima placement. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A new computation algorithm for a cryptosystem based on Lucas Functions by Othman, Mohamed, M. Abulhirat, Esam, Md Ali, Zulkarnain, Md. Said, Mohamad Rushdan, Johari, Rozita

    Published 2008
    “…The LUC Cryptosystem is a cryptosystem based on Lucas Functions. The encryption process used a public key which was known publicly and the decryption used a private key which was known only by sender and receiver of the messages. …”
    Get full text
    Article
  20. 20

    A new text-based w-distance metric to find the perfect match between words by Ali, M., Jung, L.T., Hosam, O., Wagan, A.A., Shah, R.A., Khayyat, M.

    Published 2020
    “…To improve the perfect-match calculation functionality in the traditional k-NN algorithm, a new similarity distance metric is developed and named as word-distance (w-distance). …”
    Get full text
    Get full text
    Article