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

Search alternatives:

  • Showing 1 - 8 results of 8
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
    Analysis of daytime and nighttime ground level ozone concentrations using boosted regression tree technique

    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
    Save to List
    Saved in:
  6. 6
    Area-based vs tree-centric approaches to mapping forest carbon in Southeast Asian forests from airborne laser scanning data

    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
    Save to List
    Saved in:
  7. 7
    Solubility enhancement of decitabine as anticancer drug via green chemistry solvent: Novel computational prediction and optimization

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