Search Results - (( java implementation model algorithm ) OR ( using second path algorithm ))

Search alternatives:

Refine Results
  1. 1
    AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING

    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
    Save to List
    Saved in:
  2. 2
    Provider independent cryptographic tools

    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
    Save to List
    Saved in:
  3. 3
    Modelling of multi-robot system for search and rescue

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…The simulations conducted using MATLAB demonstrate the superiority of the MPSO algorithm over the PSO algorithm in terms of average path length and execution time of all robots in all three proposed scenarios: 16 meter shorter and 7.1 seconds faster in the first scenario, 17.89 meters shorter and 6.14 seconds faster in scenario 2, and 6.18 meters shorter and 8.47 seconds faster in scenario 3. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  4. 4
    Direct approach for mining association rules from structured XML data

    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
    Save to List
    Saved in:
  5. 5
    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique

    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
    Save to List
    Saved in:
  6. 6
    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices

    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
    Save to List
    Saved in:
  7. 7
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control

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

    Published 2016
    “…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…The algorithm which consider the error value, e to increment pixels is the crucial part of the line generation applies the same concept in the second approach, where the error value, e is used as indicator to determine the heuristic cost of the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A Toolkit for Simulation of Desktop Grid Environment

    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
    Save to List
    Saved in:
  11. 11
    Fitness value based evolution algorithm approach for text steganalysis model

    Fitness value based evolution algorithm approach for text steganalysis model by Din, Roshidi, Samsudin, Azman, Tuan Muda, Tuan Zalizam, Lertkrai, P., Amphawan, Angela, Omar, Mohd Nizam

    Published 2013
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A Model for Evaluation of Cryptography Algorithm on UUM Portal

    A Model for Evaluation of Cryptography Algorithm on UUM Portal by Norliana, Abdul Majid

    Published 2004
    “…The methodology used in this study begun with problem identification, requirement identification, analysed the model process and design the simulation model. The simulation model was developed using Active Server Page, JavaScript and SQL 7.0 as database. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION

    FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION by Nor Akmal, Abdul Aziz

    Published 2005
    “…Besides, this thesis also aimed to compare both algorithms used in the system, based on their speed to generate the shortest path. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  14. 14
    Secure Image Steganography Using Encryption Algorithm

    Secure Image Steganography Using Encryption Algorithm by Siti Dhalila, Mohd Satar, Roslinda, Muda, Fatimah, Ghazali, Mustafa, Mamat, Nazirah, Abd Hamid, An, P.K

    Published 2016
    “…A system based on the proposed algorithm will be implemented using Java and it will be more secured due to double-layer of security mechanisms which are RSA and Diffie-Hellman.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…Second, both the constructive procedure (CP) and the complementary procedure (CCP) heuristic algorithms computed the optimization considering only the execution path that has been predicted by the runtime path prediction method for criteria selection, eight QoS characteristics are suggested after investigating related works on the area of web service and web service composition. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Modification of dijkstra's algorithm for safest and shortest path during emergency evacuation

    Modification of dijkstra's algorithm for safest and shortest path during emergency evacuation by Khyrina Airin Fariza, Abu Samah, Burairah, Hussin, Abd Samad, Hasan Basari

    Published 2015
    “…Therefore, this paper presents the methodology used for the modification of Dijkstra's algorithm to find the safest and shortest path. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Parallel distributed genetic algorithm development based on microcontrollers framework

    Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

    Published 2023
    Conference paper
    Save to List
    Saved in:
  18. 18
    Fuzzy modeling using Bat Algorithm optimization for classification

    Fuzzy modeling using Bat Algorithm optimization for classification by Noor Amidah, Ahmad Sultan

    Published 2018
    “…In order to solve it, Bat Algorithm method is implement in to optimization method in fuzzy modeling for classification. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  19. 19
    Modeling dynamic weight for 3D navigation routing

    Modeling dynamic weight for 3D navigation routing by Musliman, Ivin Amri, Abdul Rahman, Alias, Coors, Volker

    Published 2007
    “…In this paper, an approach for finding shortest path or route in a dynamic situation for indoors and outdoors using Single Sink Shortest Path (SSSP) routing algorithm is proposed. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path

    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path by Linsheng, R., Derahman, M. N., Kadir, M. F. A., Mohamed, M. A., Kamarudin, S.

    Published 2022
    “…However, constraints such as the need to bypass the node which has a high rate of failure exist to prevent the Dijkstra algorithm from meeting this demand. In practice, we need not only consider the shortest path but also consider the second short path, the third short path, and so on. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: