Search Results - (( parallel optimization path algorithm ) OR ( using computational path algorithm ))

Refine Results
  1. 1

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
  2. 2
  3. 3

    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

    Published 2008
    “…To further grow the computational capability of a microprocessor, there are two possible paths. …”
    Get full text
    Thesis
  4. 4

    Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques by Mustafa, Ahmed Sudad

    Published 2017
    “…In this thesis, a hybrid detection algorithm mechanism has been proposed which combines two detection algorithms based on nodes’ trustworthiness and energy consumption in a parallel manner in order to detect the black hole nodes. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision by Abu Raid, Fadi Imad Osman

    Published 2021
    “…These algorithms are then parallelized using Compute Unified Device Architecture CUDA C language to run on Graphics Processing Unit GPU for hardware acceleration. …”
    Get full text
    Get full text
    Thesis
  6. 6

    DC-based PV-powered home energy system by Sabry, Ahmad H.

    Published 2017
    “…In residential applications, energy engineers are always looking for optimal utilization of solar power to manage the energy use and reduce its impact on our economy and environment. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…In relation to that, A* algorithm was used as a path finding technique to plan a collision-free-path journey from one location to another. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries by Fadzli, S.A., Abdulkadir, S.I., Makhtar, M., Jamal, A.A.

    Published 2016
    “…The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

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

    Obstacle Avoidance System in Underwater Glider by KHYE YEE, YONG

    Published 2017
    “…It is found that the A* algorithm have better path cost but requires higher computational power. …”
    Get full text
    Get full text
    Final Year Project
  13. 13
  14. 14
  15. 15

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…In network theory, it’s known as the shortest-path problem, and Dijkstra’s algorithm is usually used to solve it. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20