Search Results - (( java solution clustering algorithm ) OR ( program visualisation based algorithm ))

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

    Constrained clustering approach to aid in remodularisation of object-oriented software systems / Chong Chun Yong by Chong, Chun Yong

    Published 2016
    “…Even if maintainers possess additional information that could be useful to guide and improve the clustering results, traditional clustering algorithms have no way to take advantage of this information. …”
    Get full text
    Get full text
    Thesis
  2. 2

    An integrated model of automated elementary programming feedback using assisted and recommendation approach by Safei, Suhailan

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

    Correlation analysis and predictive performance based on KNN and decision tree with augmented reality for nuclear primary cooling process / Ahmad Azhari Mohamad Nor by Mohamad Nor, Ahmad Azhari

    Published 2024
    “…Subsequently, predictive models employing k-nearest neighbour and decision tree algorithms are constructed and evaluated based on accuracy, precision, and recall metrics. …”
    Get full text
    Get full text
    Thesis
  4. 4

    FBGA-based implementation of electronic abacus using altera DE2 board by Sidek, Azmi

    Published 2017
    “…The electronic abacus is developed by integrating an abacus, abacus decoder module and FPGA-based processor. DE2 115 is chosen as the development module and VHDL as main programming language. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6
  7. 7

    Modified dynamic programming model with limited order picking capacity / Noraimi Azlin Mohd Nordin by Noraimi Azlin , Mohd Nordin

    Published 2021
    “…Next, to determine either Dijsktra’s algorithm or Dynamic Programming Method will give the most accurate shortest path and minimum travel time for order pickers. …”
    Get full text
    Get full text
    Get full text
    Thesis