Search Results - (( evolution classification tree algorithm ) OR ( java implementation path algorithm ))

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

    Design Of Feature Selection Methods For Hand Movement Classification Based On Electromyography Signals by Too, Jing Wei

    Published 2020
    “…In this regard, this thesis proposes five FS methods for efficient EMG signals classification. The first method is the Binary Tree Growth Algorithm (BTGA), which implements a hyperbolic tangent function to convert the Tree Growth Algorithm into the binary version. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Intersection Features For Android Botnet Classification by Ismail, Najiahtul Syafiqah, Yusof, Robiah, Saad, Halizah, Abdollah, Mohd Faizal, Yusof, Robiah

    Published 2019
    “…This paper proposed an enhancement approach for Android botnet classification based on features selection and classification algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

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

    Classification with degree of importance of attributes for stock market data mining by Khokhar, Rashid Hafeez, Md. Sap, Mohd. Noor

    Published 2004
    “…We present another modification of fuzzy decision tree (FDT) classification techniques that aims to combine symbolic decision trees in data classification with approximate reasoning offered by fuzzy representation. …”
    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

    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

    EMG Feature Selection And Classification Using A Pbest-Guide Binary Particle Swarm Optimization by Too, Jing Wei, Tee, Wei Hown, Abdullah, Abdul Rahim, Mohd Saad, Norhashimah

    Published 2019
    “…In order to measure the effectiveness of PBPSO, binary particle swarm optimization (BPSO), genetic algorithm (GA), modified binary tree growth algorithm (MBTGA), and binary differential evolution (BDE) were used for performance comparison. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10
  11. 11
  12. 12
  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