Search Results - (( java implementation path algorithm ) OR ( parameter information seeking algorithm ))

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

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

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

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

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

    Incremental continuous ant colony optimization for tuning support vector machine’s parameters by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Hence, in applying Ant Colony Optimization for optimizing Support Vector Machine parameters, which are continuous in nature, the values wil have to be discretized.The discretization process will result in loss of some information and, hence, affects the classification accuracy and seeks time.This paper presents an algorithm to optimize Support Vector Machine parameters using Incremental continuous Ant Colony Optimization without the need to discretize continuous values.Eight datasets from UCI were used to evaluate the performance of the proposed algorithm.The proposed algorithm demonstrates the credibility in terms of classification accuracy when compared to grid search techniques, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.Experimental results of the proposed algorithm also show promising performance in terms of classification accuracy and size of features subset.…”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Optimizing support vector machine parameters using continuous ant colony optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…Hence, in applying Ant Colony Optimization for optimizing Support Vector Machine parameters, which are continuous parameters, there is a need to discretize the continuous value into a discrete value.This discretization process results in loss of some information and, hence, affects the classification accuracy and seek time.This study proposes an algorithm to optimize Support Vector Machine parameters using continuous Ant Colony Optimization without the need to discretize continuous values for Support Vector Machine parameters.Seven datasets from UCI were used to evaluate the performance of the proposed hybrid algorithm.The proposed algorithm demonstrates the credibility in terms of classification accuracy when compared to grid search techniques.Experimental results of the proposed algorithm also show promising performance in terms of computational speed.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Ant Colony Optimization has been used to solve Support Vector Machine model selection problem.Ant Colony Optimization originally deals with discrete optimization problem.In applying Ant Colony Optimization for optimizing Support Vector Machine parameters which are continuous variables, there is a need to discretize the continuously value into discrete value.This discretize process would result in loss of some information and hence affect the classification accuracy and seeking time.This study proposes an algorithm that can optimize Support Vector Machine parameters using Continuous Ant Colony Optimization without the need to discretize continuous value for Support Vector Machine parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed hybrid algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.…”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Computational dynamic support model for social support assignments around stressed individuals among graduate students by Al-Shorman, Roqia Rateb

    Published 2020
    “…Hence, this study aims to develop the dynamic configuration algorithm to provide an optimal support assignment based on information generated from both social support recipient and provision computational models. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Incremental continuous ant colony optimization technique for support vector machine model selection problem by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…In applying Ant Colony Optimization for optimizing Support Vector Machine parameters which are continuous variables, there is a need to discretize the continuously value into discrete value.This discretize process would result in loss of some information and hence affect the classification accuracy and seeking time. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

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

    The influence of surface run-off to 3d slope stability analysis for rainfall induced landslide by Keling, Noraidah, Yusoff, Izham Mohamad, Lateh, Habibah, Ujang, Uznir

    Published 2015
    “…The Hovland method is one of the 3D slope stability analysis widely used due to its simple algorithm and practical engineering application. Previous studies have proposed modifying Hovland’s method and integrating it with Geographic Information System (GIS) software to make it practical to be used in a real environment. …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Evaluation of multiple In Situ and remote sensing system for early detection of Ganoderma boninense infected oil palm by Ahmadi, Seyedeh Parisa

    Published 2018
    “…In the spectral features part, the descriptors include red (R), green (G), blue (B), near-infrared (NIR) digital numbers and a vegetation index (VI) was considered. Statistical parameters like average, variance and grey-level co-occurrence matrix (GLCM) was set as a structural feature which provides several statistics information about the texture of an image. …”
    Get full text
    Get full text
    Get full text
    Thesis