Search Results - (( problem using based algorithm ) OR ( java applications clustering algorithm ))
Search alternatives:
- applications clustering »
- java applications »
- using based »
-
1
Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly
Published 2019“…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
Get full text
Get full text
Thesis -
2
A Toolkit for Simulation of Desktop Grid Environment
Published 2014“…The prototypes will be developed using JAVA language united with a MySQL database. …”
Get full text
Get full text
Final Year Project -
3
An integrated model of automated elementary programming feedback using assisted and recommendation approach
Published 2017“…Meanwhile, similar difficulty groups of the computer programs were generated using a K-Means clustering algorithm that was enhanced with ranking consideration. …”
Get full text
Get full text
Get full text
Thesis -
4
-
5
Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform
Published 2009“…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
A web-based implementation of k-means algorithms
Published 2022“…Firstly, k-luster could incorporate additional clustering algorithms, or even classification algorithms in the future. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
7
-
8
Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem
Published 2015“…In this study, rule-based multi-state gravitational search algorithm (RBMSGSA) algorithm is proposed to solve discrete combinatorial optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali
Published 2012“…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis -
10
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
Published 2021“…The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is useful in a number of applications. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
11
Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line
Published 2010“…This study presented an intelligence based genetic algorithm approach to optimize the considered problem objectives through reducing the problem complexity. …”
Get full text
Get full text
Get full text
Article -
12
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
Get full text
Get full text
Thesis -
13
Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
Published 2019“…This paper proposes Opposition-based Whale Optimization Algorithm (OWOA) to optimize solution problem in 0/1 Knapsack. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Harmony annealing algorithm for curriculum-based course timetabling problem
Published 2012“…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
15
Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems
Published 2014“…The algorithm used weight mapping crossover (WMX) and Insertion Mutation (IM) as genetic operators for sub-chromosomes represented with priority-based representation. …”
Get full text
Get full text
Thesis -
16
Optimization of cost-based hybrid flowshop scheduling using teaching-learning-based optimization algorithm
Published 2024“…This paper investigates the optimization of a CHFS problem using the Teaching Learning-Based Optimization (TLBO) algorithm. …”
Get full text
Get full text
Get full text
Article -
17
Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation
Published 2013“…The performance of the MODPSO algorithm is finally validated using artificial problems from the literature and real-world problems from assembly products.…”
Get full text
Get full text
Thesis -
18
Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems
Published 2021“…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
19
Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems
Published 2024“…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Thesis -
20
Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic
Published 2004“…These two adaptive routing algorithms enhance the existing Confidence-based Q (CQ) and Confidence-based Dual Reinforcement Q (CDRQ) Routing Algorithms. …”
Get full text
Get full text
Thesis
