Search Results - (( using processing (problems OR problem) algorithm ) OR ( java application search algorithm ))
Search alternatives:
- application search »
- using processing »
- java application »
-
1
Direct approach for mining association rules from structured XML data
Published 2012“…The thesis outlines the two different implementation techniques of the existing FLEX algorithm using java based parsers and using a query language for XML. …”
Get full text
Get full text
Thesis -
2
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
3
Message based random variable length key encryption algorithm.
Published 2009“…Value of random number should be greater than 35 bits and plaintext must be at least 7 bits. A padding algorithm was used for small size messages or big random numbers. …”
Get full text
Get full text
Article -
4
Web-based expert system for material selection of natural fiber- reinforced polymer composites
Published 2015“…Secondly, an expert system using Java programming technology with two tiers of search engine was developed to perform a fast selection of candidate materials in huge volume. …”
Get full text
Get full text
Thesis -
5
Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application
Published 2020“…This study aims to compare the performance of Boyer-Moore, Knuth morris pratt, and Horspool algorithms in searching for the meaning of words in the Java-Indonesian dictionary search application in terms of accuracy and processing time. …”
Get full text
Get full text
Journal -
6
An Effective Fast Searching Algorithm for Internet Crawling Usage
Published 2016“…The search algorithm is a crucial part in any internet applications. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
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 -
8
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 -
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
Monkey Algorithm for Packing Circles with Binary Variables
Published 2019“…In this paper the problem of packing non-congruent circles is solved using the binary version of monkey algorithm. …”
Get full text
Get full text
Article -
11
Monkey Algorithm for Packing Circles with Binary Variables
Published 2019“…In this paper the problem of packing non-congruent circles is solved using the binary version of monkey algorithm. …”
Get full text
Get full text
Article -
12
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 -
13
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 -
14
Particle swarm optimization (PSO) for CNC route problem
Published 2002“…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
Get full text
Get full text
Undergraduates Project Papers -
15
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In principle, the optimization problem is regarded as a state estimation process. …”
Get full text
Get full text
Thesis -
16
Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian
Published 2013“…In this research, we showed how evolutionary multi-objective algorithms can be used to solve the view selection problem and its advantage over classical optimization problems were described. …”
Get full text
Get full text
Thesis -
17
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 -
18
Optimization of multi-holes drilling toolpath using tiki-taka algorithm
Published 2024“…The study aims to model the MDMT toolpath using the Traveling Salesman Problem (TSP) concept, apply TTA to optimize this model, and validate the model and algorithm through machining experiments on this problem. …”
Get full text
Get full text
Thesis -
19
Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri
Published 2017“…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
Get full text
Get full text
Thesis -
20
Optimization Of Bar Linkage By Using Genetic Algorithms
Published 2005“…It is well known that GAs is best suited for unconstrained optimization problems. Optimization process will consider, lightest weight of the bar by using GAs without exceeding the allowable stress determined. …”
Get full text
Get full text
Monograph
