Search Results - (( time evaluation based algorithm ) OR ( frames extraction path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Local DTW coefficients and pitch feature for back-propagation NN digits recognition

    Local DTW coefficients and pitch feature for back-propagation NN digits recognition by Sudirman, R., Salleh, Shahruddin Hussain, Salleh, Sh-Hussain

    Published 2006
    “…The LPC features vectors are aligned between the source frames to the template using our DTW frame fixing (DTW-FF) algorithm. …”
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    Local DTW Coefficients and Pitch Feature for Back-Propagation NN Digits Recognition

    Local DTW Coefficients and Pitch Feature for Back-Propagation NN Digits Recognition by Sudirman, Rubita, Salleh, Sh-Hussain, Salleh, Shaharuddin

    Published 2006
    “…The LPC features vectors are aligned between the source frames to the template using our DTW frame fixing (DTW-FF) algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    NN with DTW-FF Coefficients and Pitch Feature for Speaker Recognition

    NN with DTW-FF Coefficients and Pitch Feature for Speaker Recognition by Sudirman, Rubita, Salleh, Sh-Hussain, Salleh, Shaharuddin

    Published 2006
    “…This paper proposes a new method to extract speech features in a warping path using dynamic programming (DP). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman

    Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman by Abdul Rahman, Faridah

    Published 2012
    “…After testing and evaluation the prototype, the result shows that the Sudoku generator based on hybrid algorithm takes more times on solving the Sudoku. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Slam-based mapping for object recognition

    Slam-based mapping for object recognition by Loh, Wan Ying

    Published 2018
    “…The SIFT (Scale-Invariant Feature Transform) is used to extract features from the current frame and match with the object database to identify and recognize the object whenever the robot come across the object. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  6. 6
    A constructive task mapping algorithm for hard real-time embedded NoCs

    A constructive task mapping algorithm for hard real-time embedded NoCs by M. Norazizi Sham Mohd Sayuti, Indrusiak L.S.

    Published 2024
    Article
    Save to List
    Saved in:
  7. 7
    A comprehensive comparison of evolutionary optimization limited by number of evaluations against time constraints

    A comprehensive comparison of evolutionary optimization limited by number of evaluations against time constraints by Jia, Hui Ong, Teo, Jason Tze Wi

    Published 2016
    “…This investigation represents the first study which empirically compares EAs based on time-based constraints against number of fitness evaluations. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Object tracing from synthetic fluid spray through instance segmentation

    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
    Save to List
    Saved in:
  9. 9
    Performance evaluation of caching placement algorithms in named data network for video on demand service

    Performance evaluation of caching placement algorithms in named data network for video on demand service by Abbas, Rasha Salem

    Published 2016
    “…The NS3 simulations and the Internet2 topology were used to evaluate and analyze the findings of each algorithm, and to compare the results based on cache sizes: 1GB, 10GB, 100GB, and 1TB. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    An evaluation of network load balancing through Ant Colony Optimization (ACO) based technique / Muhammad Nur Zikri Mohamad Hafizan

    An evaluation of network load balancing through Ant Colony Optimization (ACO) based technique / Muhammad Nur Zikri Mohamad Hafizan by Mohamad Hafizan, Muhammad Nur Zikri

    Published 2020
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  11. 11
    A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning.

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

    Published 2024
    “…For case study 2, the ACO algorithm achieved a best distance of 1071 (u) with execution time 1.91 (s), while the GA algorithm resulted in a best distance of 1082 (u) with execution time 0.08 (s). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Modeling time series data using Genetic Algorithm based on Backpropagation Neural network

    Modeling time series data using Genetic Algorithm based on Backpropagation Neural network by Haviluddin

    Published 2018
    “…This comparison is taken as a performance benchmark for the given problem. Finally, a GA based BPNN called (GA-BPNN) is designed and evaluated. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    An adaptive routing algorithm: enhanced confidence-based Q routing algorithm in network traffic

    An adaptive routing algorithm: enhanced confidence-based Q routing algorithm in network traffic by Yap, Soon Teck, Othman, Mohamed

    Published 2004
    “…Confidence-based Q (CQ) Routing Algorithm is an adaptive network routing algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Efficient genetic partitioning-around-medoid algorithm for clustering

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Biogeography based optimization (BBO) algorithm to minimise non-productive time during hole-making process

    Biogeography based optimization (BBO) algorithm to minimise non-productive time during hole-making process by Tamjidy, Mehran, Paslar, Shahla, Baharudin, B. T. Hang Tuah, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar

    Published 2015
    “…The performance of proposed algorithm is evaluated based on various test problems adopted from the literature. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    LCSS-Based Algorithm for Computing Multivariate Data Set Similarity: A Case Study of Real-Time WSN Data

    LCSS-Based Algorithm for Computing Multivariate Data Set Similarity: A Case Study of Real-Time WSN Data by Khan, Rahim, Ali, Ihsan, Altowaijri, Saleh, Zakarya, Muhammad, Rahman, Atiq Ur, Ahmedy, Ismail, Khan, Anwar, Gani, Abdullah

    Published 2019
    “…Our evaluation suggests that the proposed algorithm can be approximately 39.9% more efficient than its counterparts for various data sets in terms of computational time.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Efficiency and accuracy of scheduling algorithms for final year project evaluation management system

    Efficiency and accuracy of scheduling algorithms for final year project evaluation management system by Loo, Chang Herng, Muhammad Zulfahmi Toh, Abdullah, Ahmad Fakhri, Ab. Nasir, Nur Shazwani, Kamaruddin, Nur Hafieza, Ismail

    Published 2023
    “…This research paper conducts a comparative analysis of three algorithms: genetic algorithm, hill climbing algorithm, and particle swarm optimization algorithm, with a focus on evaluating their performance in scheduling presentations. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks

    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks by Saqer, Ahmad Sabri Mousa

    Published 2012
    “…On the other hand, the proposed distributed scheduling algorithm (MR-DSA) was evaluated by comparing its performance against performances of Greedy and the factor-graph-based low-complexity distributed scheduling algorithm (FGDS) algorithms in terms of delay, throughput, and overhead. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Improved rsync algorithm to minimize communication cost using multi-agent systems for synchronization in multi-learning management systems

    Improved rsync algorithm to minimize communication cost using multi-agent systems for synchronization in multi-learning management systems by Mwinyi, Amir Kombo

    Published 2017
    “…The experimental results show that the improved rsync (irsync) algorithm yields a better performance against two previous algorithms, rsync algorithm and hierarchical folder synchronization algorithm (HFSA) in terms of reducing computation time and improve synchronization response time. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    A coalition model for efficient indexing in wireless sensor network with random mobility / Hazem Jihad Ali Badarneh

    A coalition model for efficient indexing in wireless sensor network with random mobility / Hazem Jihad Ali Badarneh by Hazem Jihad , Ali Badarneh

    Published 2021
    “…As well as, evaluate Coalition-Based Index-Tree framework in terms of the number of traversed nodes, space-cost overhead, and index building-time. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: