Search Results - (( java implementation plan algorithm ) OR ( using code ((path algorithm) OR (based algorithm)) ))

Refine Results
  1. 1

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

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

    Simulation Of Path Optimisation Algorithms by Sim, Choon Yeee

    Published 2017
    “…In addition, the algorithm total time is shown to have decrement of 73.69%, 64% and 4.62% based on the second map simulations. …”
    Get full text
    Get full text
    Monograph
  8. 8

    Genetic algorithm based network coding in wireless ad hoc networks by Tan, Shee Eng

    Published 2013
    “…Genetic algorithm based coding-aware routing (GACAR) is embedded in the wireless ad hoc network with network coding capabilities to search for coding opportunities for unicast sessions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

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

    Evolutionary algorithm based network coding for optmization of intelligent vehicular ad hoc network by Lee, Chun Hoe

    Published 2017
    “…This project aims to improve the throughput, energy consumption and overhead of vehicular ad hoc network (VANET) by optimising the network coding (NC) using Genetic Algorithm and Particle Swarm Optimisation (GA-PSO). …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Published 2007
    “…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
  12. 12
  13. 13

    A genetic algorithm for management of coding resources in VANET by Lee, Chun Hoe, Lim, Kit Guan, Min Keng Tan, Renee Ka Yin Chin, Kenneth Tze Kin Teo

    Published 2017
    “…This project aims to improve the throughput, energy consumption and overhead of vehicular ad hoc network (VANET) by optimising the network coding (NC) using Genetic Algorithm (GA). VANET shows a promising technology as it could enhance the traffic efficiency and promote traffic safety on the road systems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    The evolution and trend of chain code scheme by Wulandhari, Lily Ayu, Haron, Habibollah

    Published 2008
    “…The codes involve 4– connected and 8– connected paths. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…The algorithm used weight mapping crossover (WMX) and Insertion Mutation (IM) as genetic operators for sub-chromosomes represented with priority-based representation. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Evolutionary algorithm based network coding for optimization of intelligent vehicular ad hoc network by Lee, Chun Hoe

    Published 2017
    “…This project aims to improve the throughput, energy consumption and overhead of vehicular ad hoe network (VANET) by optimising the network coding (NC) using Genetic Algorithm and Particle Swarm Optimisation (GA-PSO). …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning. by Rajendran, Piraviendran, Othman, Muhaini

    Published 2024
    “…In conclusion, the study successfully identifies key features in warehouses routing, implements ACO and GA algorithms, and evaluates the performance based on achieved routes and distance.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Development Of Generative Computer-Aided Process Planning System For Lathe Machining by Zubair, Ahmad Faiz

    Published 2019
    “…Furthermore, to minimize unit production cost, machining parameters including cutting speed (CS), feed rate (f) and depth of cut (d) were optimized for regular form surfaces by using firefly algorithm (FA). These parameters were then useful for tooling selections and tool-path planning. …”
    Get full text
    Get full text
    Thesis
  19. 19

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