Search Results - (( basic optimization path algorithm ) OR ( problem implementation clustering algorithm ))
Search alternatives:
- implementation clustering »
- problem implementation »
- basic optimization »
- optimization path »
- path algorithm »
-
1
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
Published 1997“…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
Get full text
Get full text
Thesis -
2
Particle swarm optimization (PSO) for CNC route problem
Published 2002“…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
Get full text
Get full text
Undergraduates Project Papers -
3
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2021“…To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. …”
Get full text
Get full text
Get full text
Article -
4
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
5
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…It makes use of three basic operations in order to optimize this problem. …”
Get full text
Get full text
Thesis -
6
Path planning algorithm for a car like robot based on MILP method
Published 2013“…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
7
Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman
Published 2020“…This study shows that Basic Theta* is able to produce the true shortest path compared to A* which produced slightly longer path. …”
Get full text
Get full text
Thesis -
8
Genetic algorithm optimization for coefficient of FFT processor
Published 2010Get full text
Get full text
Get full text
Article -
9
A new variant of black hole algorithm based on multi population and levy flight for clustering problem
Published 2020“…Meta-heuristic algorithm has been successfully implemented on data clustering problems seeking a near optimal solution in terms of quality of the resultant clusters. …”
Get full text
Get full text
Thesis -
10
Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim
Published 2012“…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 -
11
Enhanced Clustering Algorithms For Gray-Scale Image Segmentation
Published 2012“…However, in some cases the conventional clustering algorithms introduce over-segmentation problems and unable to preserve the region of interest (i.e. objects).…”
Get full text
Get full text
Thesis -
12
An improved pheromone-based kohonen self-organising map in clustering and visualising balanced and imbalanced datasets
Published 2021“…The Kohonen Self-Organising Map (KSOM) is one of the well-known clustering algorithms that can solve various problems without a pre-defined number of clusters. …”
Get full text
Get full text
Get full text
Article -
13
An Improved Pheromone-Based Kohonen Self- Organising Map in Clustering and Visualising Balanced and Imbalanced Datasets
Published 2021“…The Kohonen Self-Organising Map (KSOM) is one of the well-known clustering algorithms that can solve various problems without a pre- defined number of clusters. …”
Get full text
Get full text
Get full text
Get full text
Article -
14
Solving traveling salesman problem on cluster compute nodes
Published 2009“…In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Article -
15
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text
Thesis -
16
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 -
17
Efficient genetic partitioning-around-medoid algorithm for clustering
Published 2019“…Throughout the years, considerable efforts made to tackle the clustering problem. Yet, because of the nature of the clustering problem, finding an efficient clustering optimization algorithm with reasonable performance is still an open challenge. …”
Get full text
Get full text
Thesis -
18
Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network
Published 2023“…The problems with the K-Means algorithm concern the selection of a suitable number of clusters, the creation of a highly reliable cluster, and achieving high similarity within a cluster. …”
Article -
19
Image clustering comparison of two color segmentation techniques
Published 2010“…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Distance based sweep nearest algorithm to solve capacitated vehicle routing problem
Published 2016“…On the other hand, Sweep Nearest (SN) algorithm, an extension of Sweep, also considers smallest polar angle customer to initialize a cluster but inserted other customer based on the nearest neighbor approach. …”
Get full text
Get full text
Get full text
Proceeding Paper
