Search Results - (( developing leaf optimization algorithm ) OR ( java optimization path algorithm ))

  • Showing 1 - 10 results of 10
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
    “…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
  2. 2

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

    Published 2025
    “…Core functionalities such as path planning, autonomous movement, voice feedback, and app-to-robot communication have been thoroughly tested and optimized. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5

    Plant identification using combination of fuzzy c-means spatial pyramid matching, gist, multi-texton histogram and multiview dictionary learning by Safa, Soodabeh

    Published 2016
    “…Moreover, instead of concatenating feature vectors together and send to classifier, sparse coding and dictionary learning methods are used and instead of considering all features as one view (visual feature), K-SVD algorithm that is one of the famous algorithms for sparse representation is optimized and developed to multi-view model.The experimental results prove that the proposed methods has improved accuracy by 53.77% compared to concatenating features and classic K-SVD dictionary learning model as well.…”
    Get full text
    Get full text
    Thesis
  6. 6

    Deep plant: A deep learning approach for plant classification / Lee Sue Han by Lee , Sue Han

    Published 2018
    “…They look for the procedures or algorithms that maximize the use of leaf databases for plant predictive modelling, but this results in leaf features which are liable to change with different leaf data and feature extraction techniques. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Effective k-Means Clustering in Greedy Prepruned Tree-based Classification for Obstructive Sleep Apnea by Sim, Doreen Ying Ying, Ahmad I., Ismail, Chee Siong, Teh

    Published 2022
    “…Incorporation of prepruned decision trees to kmeans clustering through one to three types of tree-depth controllers and cluster partitioning was done to develop a combined algorithm named as Greedy Pre-pruned Treebased Clustering (GPrTC) algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Predicting the optimum compositions of a transdermal nanoemulsion system containing an extract of Clinacanthus nutans leaves (L.) for skin antiaging by artificial neural network mo... by Che Sulaiman, Intan Soraya, Basri, Mahiran, Masoumi, Hamid Reza Fard, Ashari, Siti Efliza, Basri, Hamidon, Ismail, Maznah

    Published 2017
    “…A nanoemulsion-based formulation containing leaf extracts of Clinacanthus nutans Lindau (C. nutans) was prepared for therapeutic use and optimized by artificial neural network (ANN). …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    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