Search Results - optimal ((((path algorithm) OR (based algorithm))) OR (((bayes algorithm) OR (cell algorithm))))

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

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
    Get full text
    Get full text
    Thesis
  3. 3

    Path planning algorithm for a car-like robot based on cell decomposition method by Omar, Nurhanum

    Published 2013
    “…This project proposes an obstacle avoiding path planning algorithm based on cell decomposition method for a car-like robot. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Path planning algorithm for a car like robot based on Coronoi Diagram Method by Inun, Haidie

    Published 2013
    “…The algorithm is based on Voronoi diagram method for the environment representation combined with Dijkstra’s algorithm to find the shortest path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Classification of Diabetes Mellitus using Ensemble Algorithms by Noor, N.A.B.S., Elamvazuthi, I., Yahya, N.

    Published 2021
    “…Apart from that, ensemble methods such as bagging, boosting, hybrid classifier using combinations of Random Forest with other base classifiers and ensemble algorithm which is the Random Forest has also been studied. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    An improved negative selection algorithm based on the hybridization of cuckoo search and differential evolution for anomaly detection by Ayodele Nojeem, Lasisi

    Published 2018
    “…This signifies that CSDE-V-Detectors can efficiently attain highest detection rates and lowest false alarm rates for anomaly detection. Thus, the optimization of the randomly detectors of V-Detectors algorithm with CSDE is proficient and suitable for anomaly detection tasks.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…The main aim of the research was to find an efficient route tour approach that combines path finding, path planning and path optimization algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Enhanced Image Classification for Defect Detection on Solar Photovoltaic Modules by Wiliani, Ninuk

    Published 2023
    “…The accuracy value shows that the KNN algorithm is better when compared to the Naïve Bayes algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Search algorithms for path planning problems in harsh wireless sensor network environment by Hong, Siaw Swin

    Published 2017
    “…This dissertation presents three heuristic search algorithms which all of them descended from the origin Dijkstra’s algorithm that solve multiple different problems arise from path planning in WSN environment. …”
    Get full text
    Get full text
    Thesis
  14. 14

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
  15. 15

    MULTIPLE DRONES PATH OPTIMIZATION ALGORITHM FOR 3D SPACE PERFORMANCE USING CENTRALIZED VISUALIZATION PLATFORM by Teng, Chu Yao

    Published 2019
    “…The existing methods aim for planning optimal path of drone flight. In this report, a variant of A*, Theta* algorithm is proposed to find the optimal path within a grid-based environment. …”
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  16. 16

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The objective is to verify and compare the effectiveness of both algorithms in finding the optimal robot path in different types of global map environments. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions by Ting Kien Hua, Noraini Abdullah

    Published 2020
    “…All Possible Path Algorithm (APPA) was another algorithm that was also used to rank all the alternatives path based on multiple criteria. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20