Search Results - (( basic generation clustering algorithm ) OR ( java implementation path algorithm ))

  • Showing 1 - 13 results of 13
Refine Results
  1. 1

    Basic firefly algorithm for document clustering by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

    Published 2015
    “…To address the shortcoming, this paper proposes a Basic Firefly (Basic FA) algorithm to cluster text documents.The algorithm employs the Average Distance to Document Centroid (ADDC) as the objective function of the search. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    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
  3. 3

    Knowledge-based genetic algorithm for multidimensional data clustering by Purnomo, Muhammad Ridwan Andi, Saleh, Chairul, Lagaida, R.L., Hassan, Azmi

    Published 2013
    “…In this paper, a new approach of genetic algorithm called knowledge-based Genetic Algorithm (KBGA-Clustering) is proposed for multidimensional data clustering. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  4. 4

    Knowledge-based genetic algorithm for multidimensional data clustering by Purnomo, Muhammad Ridwan Andi, Saleh, Chairul, Lagaida, Reny Lituhayu, Hassan, Azmi

    Published 2014
    “…In this paper, a new approach of genetic algorithm called knowledge-based Genetic Algorithm (KBGA-Clustering) is proposed for multidimensional data clustering. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    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
  6. 6

    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
  7. 7

    Penggunaan penggugusan subtraktif bagi menjana peraturan kabur by Agus Priyono, Muhammad Ridwan, Ahmad Jais Alias, Riza Atiq O. K. Rahmat, Azmi Hassan, Mohd. Alauddin Mohd. Ali

    Published 2005
    “…Based on the study, it is found that the system was able to generate 8 cluster center at on 30(3x10) data value at 0.3 cluster radius and also able to generate 4 cluster center at 0.5 radius with average MSE of 0.005…”
    Get full text
    Get full text
    Article
  8. 8

    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
  9. 9

    Instance matching framework for heterogeneous semantic web content over linked data environment by Mansir, Abubakar

    Published 2021
    “…These discovered attributes serve as input to a modified training set generation component, where training sets are generated based on the potential attributes’ clusters. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Butterfly Triple System Algorithm Based on Graph Theory by Ibrahim, Haslinda, Aldiabat, Raja’i, Karim, Sharmila

    Published 2022
    “…In combinatorial design theory, clustering elements into a set of three elements is the heart of classifying data, which has recently received considerable attention in the fields of network algorithms, cryptography, design and analysis of algorithms, statistics, and Information theory. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Penggunaan penggugusan subtraktif bagi menjana peraturan kabur by Priyono, Agus, Ridwan, Purnomo, Alias, Ahmad Jais, Rahmat, Riza Atiq, Hassan, Azmi, Mohd Ali, Mohd Alaudin

    Published 2005
    “…Based on this study, it is found that the system was able to generate 8 cluster center on 30 (3 x 10) data value at 0.3 cluster radius and also able to generate 4 cluster center at 0.5 radit.rs with average MSE of 0.005). …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis