Search Results - (( java implementation path algorithm ) OR ( event simulation mining algorithm ))

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

    Modeling and simulation of the industrial numerical distance relay aimed at knowledge discovery in resident event reporting by Othman, Mohammad Lutfi, Aris, Ishak, Abdul Wahab, Noor Izzri

    Published 2014
    “…The idea is to provide the flexibility of allowing the simulated event report to have sufficiently significant depth and breadth for data mining purposes. …”
    Get full text
    Get full text
    Article
  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

    Framework for mining XML format business process log data by Ang, Jin Sheng

    Published 2024
    “…After applying FSSM phases to simulation and real-life event log data, descriptive statistics, t-tests, and chi-square tests were successfully executed. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Discovering decision algorithm of distance protective relay based on rough set theory and rule quality measure by Othman, Mohamad Lutfi

    Published 2011
    “…The high prediction accuracy rate and the close-to-unity area under curve (AUC) value of ROC curve of the discovered relay decision algorithm (prediction rules) from the Rough-Set-Theory-and-Genetic-Algorithm data mining verified the algorithm’s generalized ability to predict as well as discriminate future unknown-trip-status relay events. …”
    Get full text
    Get full text
    Thesis
  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

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

    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