Search Results - (( solution using random algorithm ) OR ( java application using algorithm ))

Refine Results
  1. 1

    Novel approach for secure cover file of hidden data in the unused area within EXE file using computation between cryptography and steganography by Naji, Ahmed Wathik, Zaidan, B.B., Hameed, Shihab A., O-Khalifa, Othman

    Published 2009
    “…The strength of the information hiding science is due to the non-existence of standard algorithms to be used in hiding secret messages. Also there is randomness in hiding methods such as combining several media (covers) with different methods to pass a secret message. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    Evacuation routing optimizer (EROP) / Azlinah Mohamed … [et al.] by Mohamed, Azlinah, Yusoff, Marina, Ariffin, Junaidah, Shamsudin, Siti Maryam

    Published 2011
    “…Solutions reached by analyses with CF random and inertia weight sorted in ascending order were shown to be competitive with those obtained using inertia weight with random capacity. …”
    Get full text
    Get full text
    Research Reports
  6. 6

    The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem by Pook, Mei Foong, Ramlan, Effirul Ikhwan

    Published 2019
    “…Benchmarking is conducted using the traveling salesman problem. The results are comparable with the results of advanced metaheuristic algorithms. …”
    Get full text
    Get full text
    Article
  7. 7

    Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem by Razip, H., Zakaria, M.N.

    Published 2018
    “…We tested this approach by sampling the populations for some Set Covering Problems from OR Library using the randomized rounding method (AAR) and compared them with that sampled using a randomized heuristics (R) in terms of redundancy rate, diversity and closeness to the optimal solution (OPT). …”
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…However, the algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Real-Time Video Processing Using Native Programming on Android Platform by Saipullah, Khairul Muzzammil

    Published 2012
    “…However for the Android platform that based on the JAVA language, most of the software algorithm is running on JAVA that consumes more time to be compiled. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12
  13. 13
  14. 14

    African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems by Odili, Julius Beneoluchi, M. N. M., Kahar, Noraziah, Ahmad, Odili, Esther Abiodun

    Published 2016
    “…Similarly, both methods employ different search techniques in attempting solutions to the ATSP: while the African Buffalo Optimization uses the modified Karp-Steele technique, the Randomized Insertion employs random insertion mechanism. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    A Comparative Study of African Buffalo Optimization and Randomized Insertion Algorithm for Asymmetric Travelling Salesman's Problem by Odili, Julius Beneoluchi, M. N. M., Kahar, Shahid, Anwar, Azrag, M. A. K.

    Published 2015
    “…The Randomized Insertion and African Buffalo Optimization algorithms employ two different methods in attempting solutions to ATSP: the African Buffalo Optimization employs the modified Karp-Steele approach while the Randomized Insertion uses random insertion approach. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Binary ant colony optimization algorithm in learning random satisfiability logic for discrete hopfield neural network by Gao, Yuan, Mohd Kasihmuddin, Mohd Shareduwan, Chen, Ju, Zheng, Chengfeng, Romli, Nurul Atiqah, Mansor, Mohd. Asyraf, Zamri, Nur Ezlin

    Published 2024
    “…It aimed to optimize the performance of G-type random high-order satisfiability logic structures embedded in Discrete Hopfield Neural Networks, thereby enhancing the efficiency of the Hopfield Neural Network learning algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Real-time algorithmic music composition application. by Yap, Alisa Yi Hui

    Published 2022
    “…This project is about the study of evolutionary music, and focuses on the development of an algorithmic music composer using the Java programming language. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  18. 18

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

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

    “…In the algorithm, randomly generated solution are assigned as a predator and preys depending on their performance on the objective function. …”
    Get full text
    Monograph
  20. 20

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

    Published 2016
    “…We hyave used the CPU profiler of Oracle JavaTM VisualVM to monitor the execution of LRE-TL as well as USG algorithms. …”
    Get full text
    Get full text
    Conference or Workshop Item