Search Results - (( java implementation phase algorithm ) OR ( solving process using algorithm ))
Search alternatives:
- implementation phase »
- java implementation »
- phase algorithm »
- solving process »
- using algorithm »
-
1
Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly
Published 2019“…All the algorithm for the engine has been developed by using Java script language. …”
Get full text
Get full text
Thesis -
2
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
Get full text
Get full text
Thesis -
3
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 -
4
Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar
Published 2006“…Although from human logical thinking, the route can be generated easily but the calculation of checking the route whether it is optimal route or not is difficult and will take long time to be implemented. This research study with the development of the Optimal Route Checking Using Genetic Algorithm system should solve this scenario. …”
Get full text
Get full text
Thesis -
5
Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman
Published 2012“…Sudoku Generator is a prototype that automatically generates and solves the Sudoku. Before this, Sudoku generator has been develop using backtracking algorithm only, but this research use two algorithm which is recursive and backtracking algorithm that called as hybrid algorithm. …”
Get full text
Get full text
Thesis -
6
Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources
Published 2022“…Additionally, an appropriate selection of GA operators was also experimented. The guide genetic algorithm (GGA) is not used to solve the unspecified dynamic UPMR. …”
Get full text
Get full text
Get full text
Article -
7
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 -
8
Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems
Published 2020“…This indicates the capability of the algorithm in exploring the search space. The 2S-ENDSHHMO algorithm can be used to improve the search process of other MOSI-based algorithms and can be applied to solve MOPs in applications such as structural design and signal processing.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
9
An Experimental Study of the Application of Gravitational Search Algorithm in Solving Route Optimization Problem for Holes Drilling Process
Published 2014“…In this study, an optimization algorithm based on Gravitational Search Algorithm is proposed for solving route optimization in holes drilling process. …”
Get full text
Get full text
Conference or Workshop Item -
10
An improved sine cosine algorithm for solving optimization problems
Published 2018“…Due to its simplicity and less tedious parameter tuning over other multi-agent-based optimization algorithms, Sine Cosine Algorithm (SCA) has gained lots of attention from numerous researchers for solving optimization problem. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
11
Levy slime mould algorithm for solving numerical and engineering optimization problems
Published 2022“…Therefore, for solving the SMA algorithm local optima problem, we used the Levy distribution rather than the conventional uniform distribution in the candidate selection procedure. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Finite impulse response optimizers for solving optimization problems
Published 2019“…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
Get full text
Get full text
Thesis -
13
Levy tunicate swarm algorithm for solving numerical and real-world optimization problems
Published 2022“…Therefore, we used the Levy distribution rather than the conventional uniform distribution in the candidate selection procedure to solve the TSA algorithm local optima problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem
Published 2008“…These new parallel and sequential finite difference time domain (FDTD) algorithms yield from O(h2), ordinary O(h4) and weighted average O(h4) centered difference discretization using direct-domain and temporary-domain are used to solve problems mentioned above. …”
Get full text
Get full text
Thesis -
15
Sequential algorithm of parabolic equation in solving thermal control process on printed circuit board
Published 2008Get full text
Get full text
Conference or Workshop Item -
16
Finite impulse response optimizers for solving optimization problems
Published 2019“…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
Get full text
Get full text
Thesis -
17
Formulating new enhanced pattern classification algorithms based on ACO-SVM
Published 2013“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text
Article -
18
Generic DNA encoding design scheme to solve combinatorial problems
Published 2015“…This approach was applied successfully to solve four hard combinatorial problems. Using this encoding scheme would enable researchers to solve other hard problems whilst also improving the algorithm.…”
Get full text
Get full text
Thesis -
19
Ant colony optimization in dynamic environments
Published 2010“…For this purpose, three local search algorithms namely 2-opt, 2.S-opt and 3-opt were chosen to be coupled with the ant algorithm in order to solve the dynamic TSP. …”
Get full text
Get full text
Get full text
Thesis -
20
A review of genetic algorithms and parallel genetic algorithms on Graphics Processing Unit (GPU)
Published 2013“…Genetic Algorithms (GAs) is proven to be effective in solving many optimization tasks. …”
Get full text
Conference or Workshop Item
