Search Results - (( using processing problems algorithm ) OR ( java applications search algorithm ))
Search alternatives:
- applications search »
- java applications »
- using processing »
- problems »
-
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
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 -
3
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 -
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
Songs Search Using Human Humming Voice
Published 2007Get full text
Get full text
Final Year Project -
8
An Educational Tool Aimed at Learning Metaheuristics
Published 2020“…Initially, this tool adopts only Crow Search, Jaya, and Sine Cosine algorithms. But more metaheuristics will be included in future research. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
Evolutionary Music; Composing Beats and Chords Progression
Published 2020“…Evoluthm utilizes Harmony Search Algorithm and JFUGUE techniques in compliances with artificial intelligence (AI). …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
10
Hybrid genetic algorithm for improving fault localization
Published 2018“…Therefore, there is a need for a technique which able to localize a fault effectively with less number of mutants generated. Genetic algorithm (GA) is well known in finding an optimal solution to a problem while local search is capable of removing duplication. …”
Get full text
Get full text
Get full text
Article -
11
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 -
12
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 -
13
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 -
14
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 -
15
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 -
16
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 -
17
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 -
18
Fuzzy modeling using Bat Algorithm optimization for classification
Published 2018“…In order to create parameters, there are many problems arise in the process of fuzzy modeling. The problems are data incomplete and the size of the data is large. …”
Get full text
Get full text
Get full text
Undergraduates Project Papers -
19
Design of a flexible digital baseband signal processing algorithm
Published 2006“…In this paper, we show how we solved the problem by satisfying several requirements simultaneously: 1) removing loop or complicated algorithm in DBSP functions with flexible DBSP algorithm 2) using DSP-BIOS Scheduling module to increase performance and make sure our sample data are in packed. …”
Get full text
Get full text
Conference or Workshop Item -
20
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
