Search Results - (( java implementation path algorithm ) OR ( problem implementation clustering algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    A new variant of black hole algorithm based on multi population and levy flight for clustering problem

    A new variant of black hole algorithm based on multi population and levy flight for clustering problem by Haneen Abdul Wahab, Abdul Raheem

    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
    Save to List
    Saved in:
  4. 4
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    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
    Save to List
    Saved in:
  6. 6
    Enhanced Clustering Algorithms For Gray-Scale Image Segmentation

    Enhanced Clustering Algorithms For Gray-Scale Image Segmentation by Siddiqui, Fasahat Ullah

    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
    Save to List
    Saved in:
  7. 7
    An improved pheromone-based kohonen self-organising map in clustering and visualising balanced and imbalanced datasets

    An improved pheromone-based kohonen self-organising map in clustering and visualising balanced and imbalanced datasets by Azlin, Ahmad, Rubiyah, Yusof, Nor Saradatul Akmar, Zulkifli, Mohd Najib, Ismail

    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
    Save to List
    Saved in:
  8. 8
    An Improved Pheromone-Based Kohonen Self- Organising Map in Clustering and Visualising Balanced and Imbalanced Datasets

    An Improved Pheromone-Based Kohonen Self- Organising Map in Clustering and Visualising Balanced and Imbalanced Datasets by Ahmad, Azlin, Yusof, Rubiyah, Zulkifli, Nor Saradatul Akma, Ismail, Mohd Najib

    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
    Save to List
    Saved in:
  9. 9
    Solving traveling salesman problem on cluster compute nodes

    Solving traveling salesman problem on cluster compute nodes by I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P.

    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
    Save to List
    Saved in:
  10. 10
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    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
    Save to List
    Saved in:
  12. 12
    Efficient genetic partitioning-around-medoid algorithm for clustering

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    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
    Save to List
    Saved in:
  13. 13
    Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network

    Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network by Abdulrazzak H.N., Hock G.C., Mohamed Radzi N.A., Tan N.M.L., Kwong C.F.

    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
    Save to List
    Saved in:
  14. 14
    Image clustering comparison of two color segmentation techniques

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    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
    Save to List
    Saved in:
  15. 15
    Distance based sweep nearest algorithm to solve capacitated vehicle routing problem

    Distance based sweep nearest algorithm to solve capacitated vehicle routing problem by Akhand, M. A. H, Sultana, Tanzima, Peya, Zahrul Jannat, Rahman, M.M. Hafizur

    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
    Save to List
    Saved in:
  16. 16
    Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring

    Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring by Sameer, Fadhaa Othman, Abu Bakar, Mohd Rizam

    Published 2017
    “…A good clustering analysis implemented by good Initial Centres of clusters should be selected. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Modeling of vehicle trajectory using K-means and fuzzy C-means clustering

    Modeling of vehicle trajectory using K-means and fuzzy C-means clustering by Choong, Mei Yeen, Lorita Angeline, Chin, Renee Ka Yin, Yeo, Kiam Beng, Teo, Kenneth Tze Kin

    Published 2019
    “…As these clustering algorithms require the number of clusters as input parameter of the algorithms, the study of number of clusters for the clustering is served as focus in this paper. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
    Save to List
    Saved in:
  18. 18
    Improving the efficiency of clustering algorithm for duplicates detection

    Improving the efficiency of clustering algorithm for duplicates detection by Emran, Nurul Akmar, Abdul Rahim, Abdulrazzak Ali Mohamed, Kamal Baharin, Safiza Suhana, Othman, Zahriah, Salem, Awsan Thabet, Abd Aziz, Maslita, Md. Bohari, Nor Mas Aina, Abdullah, Noraswaliza

    Published 2023
    “…In the proposed method, high-rank attributes are selected and then preparators are applied to the selected traits. A compensation algorithm is implemented to reduce the problem of missing and distorted sort keys. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    USING LATENT SEMANTIC INDEXING FOR DOCUMENT CLUSTERING

    USING LATENT SEMANTIC INDEXING FOR DOCUMENT CLUSTERING by MUFLIKHAH, LAILIL

    Published 2010
    “…Document clustering is an implementation of data mining task. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Cauchy density-based algorithm for VANETs clustering in 3D road environments

    Cauchy density-based algorithm for VANETs clustering in 3D road environments by Jubair, Mohammed Ahmed, Ahmad, Mohd Riduan, Abdul Aziz, Izzatdin, Al-Obaidi, Ahmed Salih, Al-Tickriti, Abdullah Talaat, Hassan, Mustafa Hamid, Mostafa, Salama A., Mahdin, Hairulnizam

    Published 2022
    “…This paper attempts to solve the problem of VANETs in 3D road environments using a centralized clustering technique to develop a Cauchy density model. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: