Search Results - (( developing improving path algorithm ) OR ( java implementation model algorithm ))

Refine Results
  1. 1

    AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING by SALLEH AL-HUMAIKANI, MOHAMMED ABDULQAWI

    Published 2021
    “…RSA is one of these encryption algorithms that have been implemented in security systems. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…The recent trend of software development uses OO paradigm. Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Provider independent cryptographic tools by Ibrahim, Subariah, Salleh, Mazleena, Abdul Aziz, Shah Rizan

    Published 2003
    “…The library is implemented by using Java cryptographic service provider framework that conforms to Java Cryptographic Architecture (JCA) and Java Cryptographic Extension (JCE). …”
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
  5. 5

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Thus, a new algorithm known as infection evolution (IE) was developed in this study. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Adaptive path finding algorithm in dynamic environment for warehouse robot by Ng, Mun Kit, Chong, Yung Wey, Ko, Kwang man, Park, Young Hoon, Leau, Yu Beng

    Published 2020
    “…For example, A* path finding algorithm is developed to obtain the shortest path, while D* obtains a complete coverage path from source to destination. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms by Shen, Jiazheng, Tang, Saihong, Zhao, Ruixin, Fan, Luxin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

    Published 2025
    “…This paper proposes an improved Jellyfish Search algorithm, namely TLDW-JS, for solving the problem of optimal path planning of multi-robot collaboration in the multi-tasking of complex vertical farming environments. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

    Published 2016
    “…It is hypothesised that incorporating the acoustic path model would improve the modelling of the secondary path and subsequently improves the level of noise cancellation. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

    Published 2013
    “…The performance of Java programming model and native programming model are compared with respect to the execution time for blood vessel detection. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

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

    Published 2004
    “…Definitely this best first search algorithm saves the searching time and improves performance of shortest path finding.…”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…A simulator for desktop grid environment has been developed using Java as the implementation language due to its wide popularity. …”
    Get full text
    Get full text
    Final Year Project
  15. 15

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…Thus, this thesis aims to develop a mobile robot for industrial applications by leveraging a genetic algorithm (GA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

    Published 2016
    “…In this thesis, several proposed algorithms have been developed to improve the traffic performance in the LEO satellite network. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

    Published 2018
    “…Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20