Search Results - (( program implementation path algorithm ) OR ( parallel classification _ algorithm ))

Refine Results
  1. 1

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Vision-based robot indoor navigation by Teo, Zhin Hang

    Published 2022
    “…A navigation robot is built to test the workability and efficiency of the algorithms. In general, the algorithm can provide the nearest path to navigate around the environment without manual assistance. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

    Implementation of Autonomous Vehicle Navigation Algorithms Using Event-Driven Programming by Saman, Abu Bakar Sayuti, Sebastian , Patrick, Malek, Nadhira, Hasidin, Nurul Zahidah

    Published 2012
    “…By using FSM to describe the behaviour of a navigating mobile robot, an equivalent algorithm can be developed. The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Image classification using two dimensional wavelet coefficients with parallel computing by Ong, Yew Fai

    Published 2020
    “…This research algorithm demonstrated a very promising result with Support Vector Machines, this algorithm produces a 90% of accuracies whereas the decision tree algorithm gets 100% accuracies. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This algorithm has been tested and implemented successfully via a dual beam optical scanning system.…”
    Get full text
    Get full text
    Thesis
  6. 6

    Implementation of an autonomous mobile robot navigation algorithm using C language by Subra Mullisi, Shafeq Marwan

    Published 2009
    “…The problem can basically be divided into positioning and path planning. This report basically discusses the study and also work that has been done from previous of the chosen topic, which is Implementation of an Autonomous Mobile Robot Navigation Algorithm using 'C' language. …”
    Get full text
    Get full text
    Final Year Project
  7. 7

    Automated plant recognition system based on multi-objective parallel genetic algorithm and neural network by Sefidgar, Seyed Mohammad Hossein

    Published 2014
    “…This method resulted around 99% of classification rate. To conclude, multi objective parallel genetic algorithm can automatically tune feed forward neural network to classify the dataset with a good classification rate.…”
    Get full text
    Get full text
    Thesis
  8. 8

    Implementation of autonomous vehicle navigation algorithms using event-driven programming by Saman, Abu Bakar Sayuti, Sebastian , Patrick, Malek, Nadhira, Hasidin, Nurul Zahidah

    Published 2012
    “…By using FSM to describe the behaviour of a navigating mobile robot, an equivalent algorithm can be developed. The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    GPS boundary navigation of DrosoBots using MATLAB simulation by Zainal Abidin, Zulkifli, Ngah , Vmi Kalthum, Arshad, Mohd Rizal, Kok , Chee Hou

    Published 2010
    “…To implement this, region recognition and several path planning algorithms have been utilized. …”
    Get full text
    Get full text
    Proceeding Paper
  10. 10
  11. 11
  12. 12
  13. 13

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

    Development of obstacle avoidance technique in web-based geographic information system for traffic management using open source software by Nik Yusoff, Nik Mohd Ramli, Mohd Shafri, Helmi Zulhaidi, Muniandy, Ratnasamy, Mohammad Wali, Islam

    Published 2014
    “…Pg Routing as an extension of Postgre SQL/Post GIS database is an open source library that implements the Dijkstra shortest path algorithm. However, the functionality to avoid obstacles in that analysis is still limited. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Intelligent classification algorithms in enhancing the performance of support vector machine by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2019
    “…The average classification accuracies for the proposed ACOMV–SVM and IACOMV-SVM algorithms are 97.28 and 97.91 respectively. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment by Wong, Peng Kiong

    Published 2004
    “…This program consists of four algorithms which are conversion formulas, smooth terrain, single convex surface terrain and double convex surfaces terrain.…”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    The forecasting of poverty using the ensemble learning classification methods by Zamzuri, Muhammad Haziq Adli, Nadilah, Sofian, Hassan, Raini

    Published 2023
    “…The results of the algorithms showed the poverty trend, which helped to determine the poverty classification. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. …”
    Get full text
    Get full text
    Get full text
    Article