Search Results - (( java implementation path algorithm ) OR ( solving program mining algorithm ))

Search alternatives:

  • Showing 1 - 12 results of 12
Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    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
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    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
    Save to List
    Saved in:
  4. 4
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    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
    Save to List
    Saved in:
  5. 5
    IP algorithms in compact rough classification modeling

    IP algorithms in compact rough classification modeling by Bakar, Azuraliza Abu, Sulaiman, Md Nasir, Othman, Mohamed, Selamat, Mohd Hasan

    Published 2001
    “…The paper presents the Integer Programming (IP) algorithms in mining a compact rough classification model. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Face recognition using eigenfaces and smooth support vector machine

    Face recognition using eigenfaces and smooth support vector machine by Mhd, Furqan

    Published 2011
    “…Smoothing methods, extensively used for solving important mathematical programming problems and applications. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Face recognition using eigenfaces and smooth support vector machine

    Face recognition using eigenfaces and smooth support vector machine by Mhd, Furqan

    Published 2011
    “…Smoothing methods, extensively used for solving important mathematical programming problems and applications. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  8. 8
    An efficient and effective case classification method based on slicing

    An efficient and effective case classification method based on slicing by Shiba, Omar A. A., Sulaiman, Md. Nasir, Mamat, Ali, Ahmad, Fatimah

    Published 2006
    “…This paper introduces a new classification method based on slicing techniques that was proposed for procedural programming languages. The paper also discusses two of common classification algorithms that are used either in data mining or in general AI. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Propositional satisfiability method in rough classification modeling for data mining

    Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

    Published 2002
    “…Two models, Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) to represent the minimal reduct computation problem were proposed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A Data Mining-Based Model for Assessing Guangzhou's Higher Vocational Colleges 'New Energy Automobile Majors' Vocational Skills

    A Data Mining-Based Model for Assessing Guangzhou's Higher Vocational Colleges 'New Energy Automobile Majors' Vocational Skills by He, Ling, Hamid, Hashima

    Published 2024
    “…The approach employs algorithms for data mining to enhance the accuracy and accessibility of results through the use of Random Forest (RF) and Generalized Additive Models (GAM) in a layering architecture. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Problem restructuring in interger programming for reduct searching

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…In effect, they are very useful in generating rules when solving the classification problem that is inherent in data mining. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

    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
    Save to List
    Saved in:

Search Tools: