Search Results - (( _ processing (problems OR problem) algorithm ) OR ( java application rsa algorithm ))
Search alternatives:
- java application »
- application rsa »
- rsa algorithm »
- processing »
-
1
RSA Encryption & Decryption using JAVA
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 -
2
-
3
An improved RSA cryptosystem based on thread and CRT / Saheed Yakub Kayode and Gbolagade Kazeem Alagbe
Published 2017“…Java programming language is used to implement the algorithm. …”
Get full text
Get full text
Get full text
Article -
4
Secure Image Steganography Using Encryption Algorithm
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 -
5
Digitally signed electronic certificate for workshop / Azinuddin Baharum
Published 2017“…Digital Signature was encrypted by RSA Algorithm, a very powerful asymmetrical encryption. …”
Get full text
Get full text
Thesis -
6
Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
Published 2015“…Flow shop scheduling problems relates the generation of appropriate sequencing for processing of N machines in compliance with given processing sequence orders. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
DEVELOPMENT OF A MULTI-OBJECTIVE OPTIMZATION FRAMEWORK FOR INDUSTRIAL PROCESSES
Published 2014“…Thus, this work focuses on industrial MO problems encountered in process engineering with more than two objectives. …”
Get full text
Get full text
Thesis -
8
Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach
Published 2014“…The process sequencing problem can be modeled as the travelling salesman problem with precedence constraints (TSPPC). …”
Get full text
Get full text
Get full text
Article -
9
Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim
Published 2012“…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
Get full text
Get full text
Thesis -
10
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
Published 2018“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Article -
11
Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri
Published 2020“…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
Get full text
Get full text
Thesis -
12
Monkey Algorithm for Packing Circles with Binary Variables
Published 2019“…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
Get full text
Get full text
Article -
13
Monkey Algorithm for Packing Circles with Binary Variables
Published 2019“…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
Get full text
Get full text
Article -
14
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…A typical component in QPU is a quantum device that runs quantum algorithms; namely Quantum Algorithm Processing Unit (QAPU). …”
Get full text
Get full text
Thesis -
15
Generic DNA encoding design scheme to solve combinatorial problems
Published 2015“…The complexity of combinatorial problems is classified as NP meaning that algorithms are yet to exist to efficiently solve the problem. …”
Get full text
Get full text
Thesis -
16
Bees algorithm for Forest transportation planning optimization in Malaysia
Published 2021“…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
Get full text
Get full text
Article -
17
Optimization of multi-holes drilling path using particle swarm optimization
Published 2022“…One way to improve the multi-hole drilling is by optimising the tool path in the process. This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
Get full text
Get full text
Thesis -
18
A hybrid kidney algorithm strategy for combinatorial interaction testing problem
Published 2022“…HKA addresses the limitations in KA by improving the algorithm's exploration and exploitation processes by hybridizing KA with mutation operator, and improve the balancing control process by enhancing the filtration process in KA. …”
Get full text
Get full text
Thesis -
19
Some metaheuristic algorithms for solving multiple cross-functional team selection problems
Published 2022“…This problem belongs to a class of combinatorial and NP-Hard problems that requires an efficient search algorithm to maintain the quality of solutions and a reasonable execution time. …”
Get full text
Get full text
Article -
20
Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian
Published 2013“…Evolutionary multi-objective algorithms are considered as good candidate for solving multi-objective optimization problems and have been applied to variety of problems in different areas. …”
Get full text
Get full text
Thesis
