Search Results - (( java segmentation using algorithm ) OR ( ((coding using) OR (engine using)) path algorithm ))

Refine Results
  1. 1
  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
  4. 4
  5. 5

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

    Design and analysis multiple paths trace back and reconstruction module for DNA sequence alignment accelerator using ASIC design flow / Nurul Ain Husaini by Husaini, Nurul Ain

    Published 2010
    “…Second objective is to perform the timing analysis and third objective to implement the design using ASIC flow. The design was developed in VerilogHDL coding, simulated and synthesized using Xilinx ISE 12 and then re-implemented using Synopsys ASIC Tools implies the timing diagram and analyzes using the Design Compiler and Integrated circuit compiler to produce the layout. …”
    Get full text
    Get full text
    Student Project
  8. 8

    AUTOMATED GUIDED ROBOT (AGR) by Abd Rahim, Mohd Azlan Shah

    Published 2007
    “…A general robotics circuit construction of the mainframe target board for central processing, a controller board for the sensor feedbacks and a small base tri-wheeled structure has been fabricated by the author and continual troubleshooting and enhancement has been done for these components of the AGR. Algorithm conversion to C code programming has been done throughout the project for the obstacle avoidance and path planning algorithms based upon the GA platform ofAI.…”
    Get full text
    Get full text
    Final Year Project
  9. 9

    Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

    Published 2018
    “…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11

    Maze solving balbot by Soon, Chi Wei

    Published 2010
    “…The path control algorithm will be coded in ATMEGA 32 microcontroller. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  12. 12

    Reconfigurable enhanced path metric updater unit for Space Time Trellis Code Viterbi decoder by Abu, Mohd Azlan, Harun, Harlisya, Harmin, Mohammad Yazdi, Abdul Wahab, Noor Izzri, Rahmat, Mohd Khairil, Abd Hamid, Mohd Fairuz, Ramli, Aizat Faiz

    Published 2017
    “…Even though the Viterbi algorithm is complicated to be designed, these methods typically used large memory space to store the information that have been processed mainly at the Path Metric Updater (PMU). …”
    Get full text
    Get full text
    Article
  13. 13

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…Finally, the algorithm found, which would solve the image segmentation problem.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

    Published 2012
    “…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
    Get full text
    Get full text
    Student Project
  16. 16

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    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. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Student Project
  20. 20