Search Results - (( using processing problems algorithm ) OR ( java application svm algorithm ))
Search alternatives:
- using processing »
- java application »
- application svm »
- svm algorithm »
- problems »
-
1
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 -
2
Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde
Published 2022“…The support vector machines (SVM) algorithm obtained the overall best results of 94.5% accuracy, 91.8% precision, 91.7% recall, and 91.1% f-Measure while the naïve bayes (NB) algorithm obtained the best AUC score of 0.944 with the tweet data of Dato Seri Anwar. …”
Get full text
Get full text
Get full text
Thesis -
3
Development Of Machine Learning User Interface For Pump Diagnostics
Published 2022Get full text
Get full text
Monograph -
4
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 -
5
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 -
6
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 -
7
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 -
8
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 -
9
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 -
10
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 -
11
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 -
12
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 -
13
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 -
14
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 -
15
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 -
16
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
17
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 -
18
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 -
19
Optimization of mycelium growth using genetic algorithm for multi-objective functions
Published 2019“…Trade-off between the objectives, exist for the optimization process. To solve this issues, multi-objective genetic algorithm was chosen as the methodology for this project, specifically using NSGA-ii algorithm. …”
Get full text
Get full text
Get full text
Undergraduates Project Papers -
20
Parallel metaheuristic algorithm for route planning using CUDA
Published 2025“…Area of Study: Massively Parallel Computing, Combinatorial Optimization Keywords: Parallel Metaheuristic Algorithm, Travelling Salesman Problem, CUDA, GPU, Genetic Algorithm…”
Get full text
Get full text
Final Year Project / Dissertation / Thesis
