Search Results - (( developing code optimization algorithm ) OR ( based segmentation path algorithm ))

Refine Results
  1. 1
  2. 2

    Low Complexity Error Correction in Low Density Parity Check (LDPC) Code Decoder and Encoder for Decode and Forward Cooperative Wireless Communication by JAM'AAH, SUUD

    Published 2021
    “…The initial investigation on the existing LDPC code decoding algorithms assists to develop a low complexity LDPC code decoding algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The proposed algorithm generates the path within the prepared local map to find the path between start-to-goal positions to avoid obstacles and adhere to constraints. …”
    Get full text
    Thesis
  4. 4

    Study of optimal EG placement in radial distribution system using real coded genetic algorithm by M. H., Sulaiman, Omar, Aliman

    Published 2011
    “…This paper proposes a study of embedded generation (EG) placement in radial distribution system by utilizing real coded genetic algorithm (RCGA) technique. Several cases of EG models placements are studied in order to minimize the total power losses and to improve voltage profiles of the system. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

    Published 2021
    “…A novel methodology was used to compute simple heart risk scores called non-laboratory based heart risk score (NLHRS). The methodology is proposed as stacking ensemble ML and the best ML algorithms are used as a base learner to compute relative feature weights. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Energy efficient path-planning for unmanned aerial vehicle by Debnath, Sanjoy Kumar

    Published 2022
    “…The proposed path planning algorithm is called Iterative Elliptical- Convex Visibility Graph (IECoVG) which is based on visibility graph (VG) and Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Investigation on pattern based Algorithm for division by a constant number using Verilog code for optimization on the Nelust results by Fouziah Md Yassin, Ag Asri Ag Ibrahim, Zaturrawiah Ali Omar, Saturi Baco

    Published 2015
    “…One of the alternatives is by replacing it with cheaper adder and shifter to compute the same result. The research is to develop an algorithm of unsigned constant division via add-shift method using Verilog code. …”
    Get full text
    Get full text
    Research Report
  8. 8
  9. 9

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

    Published 2004
    “…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Modeling and querying alternative paths in Kuantan by Mohamad Salleh, Mazlina

    Published 2007
    “…Route finding solution takes the distance information in the form of directed graph based on starting (source) and ending (destination) nodes for the desired paths. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    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 new technique is been develope in order to overcome these problem. The Verilog HDL coding is been written using Quartus 2 version 9.1. …”
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Development of a scalable video compression algorithm by Khalifa, Othman Omran, Issa, Sinzobakwira, Olanweraju, Rashidah Funke, Al Khazmi, El Mahdi A

    Published 2012
    “…In this paper a rate distortion optimized video frame dropping strategy which can be applied on active network nodes during high traffic intensity for H.264/AVC was developed. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  15. 15

    Development of high quality speech compression system for Quranic recitation based on modified CELP algorithm by Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2013
    “…On such limited device, a high quality speech compression for Quranic recitation is favorable. In this paper, we developed a high quality speech compression for Quranic recitation by modifying Code Excited Linear Prediction (CELP) algorithm. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  16. 16

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…Hence, the objective of this research is to propose suitable and optimize algorithm for ANPR system on Android mobile phone. …”
    Get full text
    Get full text
    Get full text
    Book
  17. 17

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

    Published 2012
    “…Therefore, the second design is the best approach in optimizing the optimal path trace back for Smith Waterman algorithm. …”
    Get full text
    Get full text
    Student Project
  18. 18

    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 new technique is been develope in order to overcome these problem. The Verilog HDL coding is been written using Quartus 2 version 9.1. …”
    Get full text
    Get full text
    Student Project
  19. 19

    Object tracing from synthetic fluid spray through instance segmentation by Md Refat Khan, Pathan

    Published 2024
    “…The resulting objects were then analyzed using a customized nearest neighbor algorithm to calculate their correspondence between frames and a BFS algorithm was used to trace their movement path. …”
    Get full text
    Get full text
    Thesis
  20. 20