Search Results - (( java improving tree algorithm ) OR ( java implementation path algorithm ))

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

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

    Published 2019
    “…The proposed embedded system has achieved positive outcomes in comparison to the current system and the traditional algorithm with regards to the shortest path. The results show a range of 8.3% to 26.8% improvement in the proposed path compared to the traditional Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Dhany, Saputra

    Published 2008
    “…In the present work, Separator Database is proposed to improve PrefixSpan with pseudoprojection through early removal of uneconomical in-memory sequenced database, whilst SPM-Tree framework is proposed to build the intermediated databases. …”
    Get full text
    Thesis
  3. 3

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    “…In the present work, Separator Database is proposed to improve PrefixSpan with pseudoprojection through early removal of uneconomical in-memory sequenced database, whilst SPM-Tree framework is proposed to build the intermediated databases. …”
    Get full text
    Get full text
    Thesis
  4. 4

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

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

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

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

    Published 2008
    “…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. …”
    Get full text
    Get full text
    Citation Index Journal
  9. 9

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Landslide Susceptibility Mapping with Stacking Ensemble Machine Learning by Solihin M.I., Yanto, Hayder G., Maarif H.A.-Q.

    Published 2024
    “…In this paper, the stacking ensemble method is used to increase the accuracy of the machine learning model for LSM where the base (first-level) learners use five ML algorithms namely decision tree (DT), k-nearest neighbor (KNN), AdaBoost, extreme gradient boosting (XGB) and random forest (RF). …”
    Conference Paper
  11. 11

    A cluster-based hybrid replica control protocol for high availability in data grid by Mabni, Zulaile

    Published 2019
    “…A clustering algorithm has been proposed to group the large nodes into clusters and organize these clusters into a tree structure. …”
    Get full text
    Get full text
    Thesis
  12. 12

    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