Search Results - (( causing problems path algorithm ) OR ( java application optimization algorithm ))

Refine Results
  1. 1
  2. 2

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

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…This project is about to develop a software which applying ACO algorithm in order to calculate the shortest path available that can reduce the time taken to drill the entire hole of PCB. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  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 existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Article
  7. 7

    An improved narrowband active noise control system without secondary path modelling based on the time domain by Mondal, Kuheli, Das, Saurav, Hamada, Nozomu, Haji Abu, Aminudin, Das, Saikat, Faris, Waleed Fekry, Toh, Hoong Thiam, Ahmad, Akij

    Published 2019
    “…Several secondary path, acoustic noise cancellation modelling causes the problems to increase the complexity of ANC implementation, reduction of performance caused by modelling error and requirement of auxiliary noise for secondary path modelling. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  9. 9

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

    Published 2012
    “…Due to the increasing number of the population, it also affected the increases number of probability in Deoxyribonucleic Acid (DNA) sequences alignment. This will cause disadvantages in the performance and speed level of the Smith-Waterman Algorithm. …”
    Get full text
    Get full text
    Article
  10. 10

    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 existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Student Project
  11. 11

    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime by Ahmad, Noor Azlan

    Published 2008
    “…The combination metrics of the lifetime and the sequence number in the table entry is used to solve the problem of the discarded active path information when the lifetime is expired. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

    Development of robust control scheme for wheeled mobile robot in restricted environment by Muhammad Sawal, A Radzak

    Published 2021
    “…The control of MWR in the restricted areas during path execution still a complicated problem in robot researches, since it needs to maintain the tracking errors at the zero level and the wheel mobile robot must follow robustly the pre-defined path using a suitable control system; otherwise it can cause to crash robot with other objects. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Efficient flow-based channel assignment schemes for congestion avoidance in wireless mesh networks by Abdulla Mogaibel, Hassen Abd-Almotaleb

    Published 2016
    “…Next, AODV-MRCR is extended to address the problems of throughput limitation and reduction which are caused by channel assignment overhead, interference caused by hidden nodes, and link congestion at the critical links in WMN. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Adaptive Algorithm for Optimal Route Configuration in Multi-Hop Wireless Sensor Network by Shabani, Hikma, Ahmed Mohamed, Ahmed Haidar, Norhuzaimin, Julai, Musse, Mohamud Ahmed, Hoole, P.R.P., Marai, Majdi

    Published 2017
    “…To gather relevant data, the route optimization mechanism is used to solve the long routing problem and provide the shortest path amongst communicating nodes. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak by Abdul Razak, Noorfadzli

    Published 2018
    “…Integrating a trajectory correction algorithm in the navigation control can overcome this problem. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Robot path planning using family of SOR iterative methods with laplacian behaviour-based control by Azali Saudi

    Published 2015
    “…In addition, the newly proposed LBBC overcomes the drawback of the existing GDS that face difficulty when handling complex environment. Finally, the path planning problem is solved by combining the fast iterative method with the robust path searching LBBC technique, so that the path planning algorithm is capable of handling large and complex environment.…”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20