Search Results - (( java implementation path algorithm ) OR ( using call based algorithm ))

Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Enhance key generation algorithm based user string identity as public key by Norhidayah, Muhammad

    Published 2015
    “…This study aims to enhance a previous algorithm called the Tripathi algorithm. The Tripathi algorithm proposes an RSA based approach to generate cryptographic keys using a user’s identity, such as an E-mail address. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Algorithm enhancement for host-based intrusion detection system using discriminant analysis by Dahlan, Dahliyusmanto

    Published 2004
    “…The correlation of each system calls are examined using coefficient correlations of each selected system call variables. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Efficient radio resource management algorithms for downlink long term evolution networks by Mamman, Maharazu

    Published 2018
    “…Our algorithms prolong the battery life by adjusting the base station using initial and final states. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…Multi-bases number representation is used to construct new versions of Miller’s algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Fast zerox algorithm for routing in optical multistage interconnection networks. by T.D. , Shahida, Othman, Mohamed, Abdullah, M. Khazani

    Published 2010
    “…Based on the ZeroX algorithm, a fast and efficient crosstalk-free time- domain algorithm called the Fast ZeroX or shortly FastZ_X algorithm is proposed for solving optical crosstalk problem in optical Omega multistage interconnection networks. …”
    Get full text
    Get full text
    Article
  11. 11

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

    Published 2012
    “…Before this, Sudoku generator has been develop using backtracking algorithm only, but this research use two algorithm which is recursive and backtracking algorithm that called as hybrid algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12

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

    Published 2011
    “…The proposed 2D path planning algorithms, on the contrary, select a relatively smaller number of vertices using the so-called base line (BL), thus they are computationally efficient. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Designing substitution boxes based on chaotic map and globalized firefly algorithm by Ahmed, Hussam Alddin Shihab

    Published 2019
    “…The second variation is called globalized firefly algorithm (GFA), which employs random movement based on the best firefly using chaotic maps. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…CST was compared to other selected classification methods based on feature subset selection such as Induction of Decision Tree Algorithm (ID3), Base Learning Algorithm K-Nearest Nighbour Algorithm (k-NN) and NaYve Bay~sA lgorithm (NB). …”
    Get full text
    Get full text
    Thesis
  15. 15

    Algorithms for extracting adjacency matrix based on Formal Concept Analysis (FCA) by Hasni, Hassan, Aznida Hayati, Zakaria@Mohamad, Mohd Isa, Awang, Mokhairi, Makhtar, Rohana, Ismail, Fadhilah, Ahmad

    Published 2017
    “…However, the focus of the paper is on a method proposed to extract adjacency matrix from concepts obtained from the theory of Formal Concept Analysis (FCA) using two consecutive algorithms called the Relatedness Algorithm and Adjacency Matrix Algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    A New Mobile Botnet Classification based on Permission and API Calls by Yusof, M, Saudi, MM, Ridzuan, F

    Published 2024
    “…As a result, 16 permissions and 31 API calls that are most related with mobile botnet have been extracted using feature selection and later classified and tested using machine learning algorithms. …”
    Proceedings Paper
  17. 17
  18. 18

    Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks by Raja Mohd Auzar, Tengku Dian Shahida

    Published 2009
    “…Then, the Fast Zero (FastZ) algorithm is proposed, which uses a new concept called the symmetric Conflict Matrix (sCM) as a pre-scheduling technique. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…To address these problems, this research proposes three new distributed static batch mode inspired algorithms. The first (proposed) algorithm is based on Min-Min, called Min-Diff, the second algorithm is based on Max-Min, called Max-Average, and the third algorithm is to handle the load balancing, called Efficient Load Balancing (ELB). …”
    Get full text
    Get full text
    Get full text
    Thesis