Search Results - (( developing fraction tree algorithm ) OR ( java optimization path algorithm ))

  • Showing 1 - 8 results of 8
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

    Analysis of daytime and nighttime ground level ozone concentrations using boosted regression tree technique by Yahaya, Noor Zaitun, Ghazali, Nurul Adyani, Ahmad, Sabri, Mohammad Asri, Mohammad Akmal, Ibrahim, Zul Fahdli, Ramli, Nor Azman

    Published 2017
    “…Sensitivity testing of the BRT model was conducted to determine the best parameters and good explanatory variables. Using the number of trees between 2,500-3,500, learning rate of 0.01, and interaction depth of 5 were found to be the best setting for developing the ozone boosting model. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Area-based vs tree-centric approaches to mapping forest carbon in Southeast Asian forests from airborne laser scanning data by David A. Coomes, Michele Dalponte, Tommaso Jucker, Gregory P. Asner, Lindsay F. Banin, David F.R.P. Burslem, Simon L. Lewis, Reuben Nilus, Oliver L. Phillips, Phua, Mui How, Lan Qie

    Published 2017
    “…We compare the performance of (a) an area-based model developed by Asner and Mascaro (2014), and used primarily in the neotropics hitherto, with (b) a tree centric approach that uses a new algorithm (itcSegment) to locate trees within the ALS canopy height model, measures their heights and crown widths, and calculates biomass from these dimensions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Solubility enhancement of decitabine as anticancer drug via green chemistry solvent: Novel computational prediction and optimization by Nader Ibrahim Namazi, Sameer Alshehri, Rawan Bafail, Bader Huwaimel, Amal M. Alsubaiyel, Ali H. Alamri, Ahmed D. Alatawi, Hossam Kotb, Mohd Sani Sarjadi, Md. Lutfor Rahman, Mohammed A.S. Abourehab

    Published 2022
    “…One of the two input features is P (bar) and the other is T (k). ADA-DT (Adaboost Algorithm Decision Tree), ADA-LR (Adaboost Algorithm-Linear Regresion), and ADA-GRNN (Generative Regression Neural Network) models showed MAE of 6.54 ˣ 10ˉ⁵, 4.66 10 ˉ⁵, and 8.35 10 ˉ⁵, respectively. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  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