Search Results - (( variable localization based algorithm ) OR ( java application rsa algorithm ))
Search alternatives:
- variable localization »
- localization based »
- java application »
- application rsa »
- rsa algorithm »
-
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
-
7
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem
Published 2016“…The AVNS consists of two stages: a learning phase and a multi-level VNS with guided local search. The adaptive aspect is integrated in the local search where a set of highly successful local searches is selected based on the intelligent selection mechanism. …”
Get full text
Get full text
Get full text
Article -
8
Fuzzy Adaptive Tuning of a Particle Swarm Optimization Algorithm for Variable-Strength Combinatorial Test Suite Generation
Published 2018“…Research has shown that stochastic population-based algorithms such as particle swarm optimization (PSO) can be efficient compared to alternatives for VS-CIT problems. …”
Get full text
Get full text
Get full text
Book Chapter -
9
A decomposed streamflow non-gradientbased artificial intelligence forecasting algorithm with factoring in aleatoric and epistemic variables / Wei Yaxing
Published 2024“…The firefly algorithm remains a feasible alternative for shallow architectural network models, while metaheuristic algorithms such as the Particle swarm algorithm and Bat algorithm are better options for deeper architectural network models. …”
Get full text
Get full text
Get full text
Thesis -
10
Potential norms detection in social agent societies
Published 2023“…According to the literature, an agent changes or revises its norms based on variables of local environment and amount of thinking about its behaviour. …”
Article -
11
Seed disperser ant algorithm for optimization / Chang Wen Liang
Published 2018“…The genotype of every ant is represented in binary form as the variables. These binary variables are used to locally search for optimum solution. …”
Get full text
Get full text
Get full text
Thesis -
12
Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems
Published 2009“…We choose an initial point and then perform a local search to find an initial local minimizer. …”
Get full text
Get full text
Get full text
Thesis -
13
Identification of continuous-time hammerstein model using improved archimedes optimization algorithm
Published 2024“…Although various optimization algorithms have been widely employed in multiple applications, the traditional Archimedes optimization algorithm (AOA) has presented imbalanced exploration with exploitation phases and the propensity for local optima entrapment. …”
Get full text
Get full text
Get full text
Get full text
Article -
14
Acoustic emission partial discharge localization in oil based on artificial bee colony
Published 2025“…Comparisons with the genetic algorithm (GA), particle swarm optimization (PSO) and bat algorithm (BA) revealed that the distance error, maximum deviation and computation time for AE PD localization based on ABC are the lowest. …”
Get full text
Get full text
Get full text
Article -
15
Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly
Published 2023“…Greedy heuristics is a type of optimization algorithm that makes decisions based on locally optimal solutions. …”
Get full text
Get full text
Thesis -
16
Building norms-adaptable agents from Potential Norms Detection Technique (PNDT)
Published 2023“…The literature proposes that an agent changes or updates its norms based on the variables of the local environment and the amount of thinking about its behaviour. …”
Short Survey -
17
Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria
Published 2021“…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
Get full text
Get full text
Article -
18
Multi-Objective Multi-Exemplar Particle Swarm Optimization Algorithm with Local Awareness
Published 2024“…This capability is essential for solving complex problems across diverse scientific and engineering domains, where achieving optimal solutions often requires balancing multiple objectives. One of these MOO algorithms Multi-Objective Particle Swarm Optimization (MOPSO) extends it to handle problems with multiple objectives simultaneously, but like many swarm-based algorithms, MOPSO can suffer from premature convergence or local optima solutions. …”
Get full text
Get full text
Get full text
Article -
19
Analysis of robot localisation performance based on extended kalman filter
Published 2015“…This project is implemented based on the existing localisation algorithm [30]. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis
Published 2014“…This is done through sharing information of particle position between the dimensions (variables) at any iteration. The strategy can enhance the exploration capability of the GPSO algorithm to determine the optimum global solution and avoid traps at the local optimum. …”
Get full text
Get full text
Get full text
Article
