Search Results - (( java application optimized algorithm ) OR ( _ coding ((method algorithm) OR (path algorithm)) ))

Refine Results
  1. 1

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…This means A • algorithm only calculates and consider the next node m path that has the lowest value of G and F, plus searching the shortest route by using heuristic estimation in Manhattan method. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Simulation Of Path Optimisation Algorithms by Sim, Choon Yeee

    Published 2017
    “…Likewise, when comparing between Bidirectional Searching with Replanning and Unidirectional Searching with Replanning, a decrease of 41.08%, 25.57% and 14.41% on algorithm total time can be seen. Thus, in this final year project, the optimum algorithm to use is A* algorithm with Bidirectional Searching method and Replanning method included during the searching process. …”
    Get full text
    Get full text
    Monograph
  4. 4

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

    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
    “…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
    Get full text
    Get full text
    Article
  6. 6

    Development of low power viterbi decoder on complex programmable logic device platform by Abu, Mohd Azlan

    Published 2018
    “…For the path metric updater unit (PMU), the traditional method of Viterbi algorithm is to store the selected minimum value of branch metric in the memory unit. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

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

    Published 2010
    “…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
    Get full text
    Get full text
    Student Project
  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

    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

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

    Improving the efficiency of minimum determinant computation in space time trellis code with optimal subtree pruning by Ungku Azlin Ungku Chulan, Norbahiah Misran, Mohammad Tariqul Islam

    Published 2024
    “…The calculation of minimum determinant plays a crucial role in fulfilling the determinant criterion of a certain code design in space time trellis code. In the heuristic optimization of code construction, the minimum determinant is derived via a variant of the branch and bound algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  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

    Improvement of a Dynamic Frequency Hopping Optical Code Division Multiple Access System Using Power Control Method by Mazehr Algalbi, Wamidh J.

    Published 2009
    “…In this thesis, adaptive power control method is proposed to improve the performance of dynamic frequency hopping-optical code division multiple access (DFH-OCDMA) communication system. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Dynamic transmit antenna shuffling scheme for hybrid multiple-input multiple-output in layered architecture by Chong, Jin Hui

    Published 2010
    “…Finally, the performance of V-BLAST/STBC transceiver scheme with proposed LC-QR algorithm is compared with other MIMO systems, such as V-BLAST and orthogonal space-time block codes. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Analysis of robot localisation performance based on extended kalman filter by Che Hassan, Farah Hazwani

    Published 2015
    “…First is the performance of the algorithm using different parameters in which different velocities and number of landmarks have been used to determine the accuracy of the localisation method. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

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