Search Results - (( java implication _ algorithm ) OR ( time reduction ((method algorithm) OR (path algorithm)) ))

Refine Results
  1. 1

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

    Real time nonlinear filtered-x lms algorithm for active noise control by Sahib, Mouayad Abdulredha

    Published 2012
    “…However, unlike the other algorithms, NLFXLMS cannot be implemented in real time. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Minimization of tool path length of drilling process using particle swarm optimization (PSO) by Abdullah, Haslina, Zaman, Nizam Nurehsan, Talib, Norfazillah, Lee, Woon Kiow, Saleh, Aslinda, Zakaria, Mohamad Shukri

    Published 2020
    “…Therefore, in this study, the Particle Swarm Optimization (PSO) algorithm was develop in order to minimizing the tool path length in the drilling process which can produce the better results for the required machining time process. …”
    Get full text
    Get full text
    Book Section
  4. 4

    Design of radix-4 single path delay fast fourier transform processor with genetic algorithms optimization by Pang, Jia Hong

    Published 2011
    “…This research work involves the implementation of Single Objective Genetic Algorithm (SOGA) and Multi-objectives Genetic Algorithm (MOGA) in a 16-point Radix-4 Single Path Delay Feedback (R4SDF) pipelined Fast Fourier Transform (FFT) processor. …”
    Get full text
    Get full text
    Thesis
  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
    “…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
  6. 6

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…These algorithms are inspired by the estimation capability of the well-known Kalman filter estimation method. …”
    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
    “…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
  8. 8

    A Review of Multi-holes Drilling Path Optimization Using Soft Computing Approaches by Najwa Wahida, Zainal Abidin, M. F. F., Ab Rashid, N. M. Zuki, N. M.

    Published 2017
    “…In future, the researcher is suggested to give focus on energy consumption that related with sustainable manufacturing and also to explore the potential of new meta-heuristics algorithms that can lead to significant in reduction machining time.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Multi-drones energy efficient based path planning optimization using Genetic Algorithm and Gradient Decent approach by Mustafa, Yousra A, Ali, Elmustafa S, Osman, Thana E, Khalifa, Othman Omran, Mohamed, Zainb O, Saeed, Rashid A, Saeed, Mamoon M

    Published 2024
    “…The paper introduces an efficient energy optimization technique for multi-drones through path planning using Genetic Algorithm (GA) and Gradient Descent (GD). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  10. 10

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

    Published 2016
    “…To observe the effectiveness of the ACO performance, the simulation results are compared with the results obtained by the previous method. Finally the simulation results show the reduction of 5% machining time compared to previous method.…”
    Get full text
    Get full text
    Article
  11. 11

    Ant colony algorithm for text classification in multicore-multithread environment / Ahmad Nazmi Fadzal by Fadzal, Ahmad Nazmi

    Published 2017
    “…ACO classification accuracy is compared to Genetic Algorithm classifier which also a wrapper method. On integration of the technique, ACO is proposed to work in a multicore-multithread environment to gain additional execution time advantage. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Improvement and application of particle swarm optimization algorithm by Deevi, Durga Praveen, Kodadi, Sharadha, Allur, Naga Sushma, Dondapati, Koteswararao, Chetlapalli, Himabindu, Perumal, Thinagaran

    Published 2025
    “…Finally, real-world tests are performed to verify the proposed Algorithm's efficacy compared to existing optimization methods. …”
    Get full text
    Get full text
    Article
  14. 14

    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
  15. 15
  16. 16

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…Metaheuristic is one of the “approximation methods” that is able to find practically acceptable solutions especially for large-scale problems within a limited amount of time. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

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

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The problem is to find the global path that satisfies the optimization criteria, which are shorter path length and less computation time. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Reduction the Effect of Mobility in Link Transmitting Using Efficient DSR Route Cache for MANETs by Ayoob, Ayoob A., Norrozila, Sulaiman, Mohammed, Muamer N., Ghaida M., Abdilsahib

    Published 2014
    “…The DSR (Dynamic Source Routing) routing protocol dependent on the cache memory for every node to store the routing path from source to destination. This paper presented a new algorithm using DSR routing cache technique to improve the routing between mobile nodes to reduction the effect of mobility in link transmitting that can solve link broken problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  20. 20