Search Results - (( problem solving path algorithm ) OR ( java application rsa algorithm ))

Search alternatives:

Refine Results
  1. 1
    RSA Encryption & Decryption using JAVA

    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
    Save to List
    Saved in:
  2. 2
    AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING

    AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING by SALLEH AL-HUMAIKANI, MOHAMMED ABDULQAWI

    Published 2021
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    An improved RSA cryptosystem based on thread and CRT / Saheed Yakub Kayode and Gbolagade Kazeem Alagbe

    An improved RSA cryptosystem based on thread and CRT / Saheed Yakub Kayode and Gbolagade Kazeem Alagbe by Yakub Kayode, Saheed, Kazeem Alagbe, Gbolagade

    Published 2017
    “…Java programming language is used to implement the algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…Dijkstra's Algorithm is one of them. This approach solves the single-source shortest path problem with nonnegative edge weights. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Search algorithms for path planning problems in harsh wireless sensor network environment

    Search algorithms for path planning problems in harsh wireless sensor network environment by Hong, Siaw Swin

    Published 2017
    “…This dissertation presents three heuristic search algorithms which all of them descended from the origin Dijkstra’s algorithm that solve multiple different problems arise from path planning in WSN environment. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    An experiment on the performance of shortest path algorithm

    An experiment on the performance of shortest path algorithm by Chan, Simon Yew Meng, Adnan, Nur’ayuni, Sukri, Syazwan Syafiqah, Wan Zainon, Wan Mohd Nazmee

    Published 2016
    “…The analysis of result shows the performance of each algorithm in order to suggest the most efficient algorithm in solving the shortest path problem…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Secure Image Steganography Using Encryption Algorithm

    Secure Image Steganography Using Encryption Algorithm by Siti Dhalila, Mohd Satar, Roslinda, Muda, Fatimah, Ghazali, Mustafa, Mamat, Nazirah, Abd Hamid, An, P.K

    Published 2016
    “…A system based on the proposed algorithm will be implemented using Java and it will be more secured due to double-layer of security mechanisms which are RSA and Diffie-Hellman.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Path Optimization For Cooperative Multi-Head 3d Printing

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…Previous authors have shown that the LPOP can be defined in terms of the Undirected Rural Postman Problem (URPP), a known problem in graph theory. Two well-known algorithms for solving a closely related graph theory problem known as the Travelling Salesman Problem (TSP) are the Ant System (AS) and Ant Colony System (ACS) algorithms. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  9. 9
    A robust GA-based QoS routing algorithm for solving multi-constrained path problem

    A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

    Published 2023
    “…This paper presents a GAbased QoS routing algorithm for solving the general kconstrained problem which has the capability to return multiple feasible paths in a single run. …”
    Article
    Save to List
    Saved in:
  10. 10
    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…In order to achieve the objective, Weighted Sum-Dijkstra’s Algorithm (WSDA), a combination method between WSM and Dijkstra’s Algorithm is applied to solve multiple criteria network problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem

    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

    Published 2024
    Article
    Save to List
    Saved in:
  12. 12
    Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms

    Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms by Shen, Jiazheng, Tang, Saihong, Zhao, Ruixin, Fan, Luxin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

    Published 2025
    “…This paper proposes an improved Jellyfish Search algorithm, namely TLDW-JS, for solving the problem of optimal path planning of multi-robot collaboration in the multi-tasking of complex vertical farming environments. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Simulation of identifying shortest path walkway in library by using ant colony optimization

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…The system is used to be error free and the algorithm can effectively solve the shortest path problem.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  14. 14
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…In this research, a sampling-based path planning algorithm was proposed which employs several heuristic and intelligent techniques to improve the performance of the planner in terms of quality of the resulted paths, runtimes of the planner, stability of the results in different executions, ability to solve difficult problems effectively and capability of planning in unknown environment. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Finding multi-constrained path using genetic algorithm

    Finding multi-constrained path using genetic algorithm by Yussof S., See O.H.

    Published 2023
    “…As such, various heuristics and approximation algorithms have been proposed to solve the MCP problem. …”
    Conference paper
    Save to List
    Saved in:
  17. 17
    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm

    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

    Published 2023
    “…As such, various heuristics and approximation algorithms have been proposed to solve the MCP problem. …”
    Article
    Save to List
    Saved in:
  18. 18
    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment

    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment by Suwoyo, Heru, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, ANDIKA, JULFRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: