Search Results - (( rendering optimization model algorithm ) OR ( program implementation path algorithm ))

Refine Results
  1. 1

    Optimization Of 3d Reconstruction Surface Rendering Algorithm For Osferion Bone Void Filling by Chin, Daniel Jie Yuan

    Published 2023
    “…Thus, the objectives are to enhance the Marching Cubes or the Marching Tetrahedra algorithm for large CT/MRI datasets so that the reconstructed 3D models are rendering-device-agnostic and optimized and to improve the quality of the 3D models after reducing the number of vertices and faces so that the surface of the 3D models can be improved. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

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

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

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

    Binary ant colony optimization algorithm in learning random satisfiability logic for discrete hopfield neural network by Gao, Yuan, Mohd Kasihmuddin, Mohd Shareduwan, Chen, Ju, Zheng, Chengfeng, Romli, Nurul Atiqah, Mansor, Mohd. Asyraf, Zamri, Nur Ezlin

    Published 2024
    “…This study introduced a novel ant colony optimization algorithm that implements the population selection strategy of the Estimation of Distribution Algorithm and a new pheromone updating formula. …”
    Get full text
    Get full text
    Get full text
    Article
  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

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

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

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

    Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach by Ab Ghani, Mohd Ruddin, Hindi, K. S.

    Published 1991
    “…Otherwise, Dantzig-Wolfe decomposition is invoked, using almost all the information generated during subgradient optimization to ensure a speedy conclusion. The computational efficiency of the algorithm renders it suitable for on-line dispatch.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17

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

    Solving a Reconfigurable Maze using Hybrid Wall Follower Algorithm by Saman, Abu Bakar Sayuti, Abdramane, Issa

    Published 2013
    “…A wall follower algorithm with combined left-hand and right-hand rules is implemented upon several different maze configurations. …”
    Get full text
    Get full text
    Citation Index Journal
  19. 19
  20. 20