Search Results - (( using function path algorithm ) OR ( problem implementation clustering algorithm ))
Search alternatives:
- implementation clustering »
- problem implementation »
- using function »
- path algorithm »
- function path »
-
1
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 -
2
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 -
3
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 -
4
A-star (A*) algorithm implementation for robotics path planning navigation
Published 2018“…This thesis is about the implementation of Astar (A*) algorithm as path planning algorithm used in robotics navigation. …”
Get full text
Get full text
Undergraduates Project Papers -
5
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
Published 1997“…The euler's path it using pseudo input and Heuristic algorithm to find the minimum interlace. …”
Get full text
Get full text
Thesis -
6
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 -
7
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 -
8
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 -
9
Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm
Published 2023Conference Paper -
10
Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group
Published 2014“…Consequently, the gradient of the potential functions would be used by the searching algorithm to generate path from starting to goal location. …”
Get full text
Get full text
Get full text
Article -
11
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 -
12
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 -
13
False path identification algorithm framework for nonseparable controller-data path circuits
Published 2016“…This paper proposes an algorithm frame-work to deal with these false paths through identification for DFT test. …”
Get full text
Get full text
Conference or Workshop Item -
14
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 -
15
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 -
16
Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control
Published 2016“…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
Get full text
Get full text
Thesis -
17
False path identification algorithm framework for nonseparable controller-data path circuits
Published 2017“…This paper proposes an algorithm framework to deal with these false paths through identification for DFT test. …”
Get full text
Get full text
Article -
18
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 -
19
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
Get full text
Get full text
Thesis -
20
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
Published 2016“…The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. …”
Get full text
Get full text
Conference or Workshop Item
