Search Results - (( developing using connection algorithm ) OR ( java implementation path 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

    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan by Rosselan, Muhammad Zakyizzuddin

    Published 2018
    “…Later, an Iterative-based Sizing Algorithm (ISA) was developed to determine the optimal sizing solution which was later used as benchmark for sizing algorithms using optimization methods. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network by Puteri Azwa, Ahmad

    Published 2014
    “…The performance of Extended Virtual Force-Based Algorithm (EVFA) and Cuckoo Search (CS) algorithm are evaluated and EVFA shows the improvement of coverage area and exhibits a guaranteed connectivity compared to CS algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Cuckoo search algorithm for sizing optimization in grid-connected photovoltaic system: article / Wan Nur Liyana Wan Abd Rahman by Wan Abd Rahman, Wan Nur Liyana

    Published 2013
    “…This paper presented the configuration of a photovoltaic (PV) array of a grid-connected photovoltaic (GCPV) system by using Cuckoo Search (CS) algorithm. …”
    Get full text
    Get full text
    Article
  8. 8

    Cuckoo search algorithm for sizing optimization in grid-connected photovoltaic system / Wan Nur Liyana Wan Abd Rahman by Wan Abd Rahman, Wan Nur Liyana

    Published 2013
    “…This paper presented the configuration of a photovoltaic (PV) array of a grid-connected photovoltaic (GCPV) system by using Cuckoo Search (CS) algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network by Othman, Mohamed, Abdullah, Monir, Johari, Rozita

    Published 2008
    “…In this paper, a new parallel algorithm of the window method is developed called the Balanced Parallel Window Method (BPWM) algorithm. …”
    Get full text
    Get full text
    Article
  11. 11

    Quality of service management algorithms in WiMAX networks by Saidu, Ibrahim

    Published 2015
    “…Simulation have been extensively used to evaluate the proposed algorithm. Finally, Discrete Event Simulator (DES) is designed and developed in order to evaluate the performance of the proposed algorithms. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Performance enhancement of AIMD algorithm for congestion avoidance and control by Jasem, Hayder Natiq

    Published 2011
    “…National Chiao Tung University’s network simulation (NCTUns) has been used in this development to compare the new algorithm with the older versions and determine its advantages over the older versions. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…In this research, Dijkstra’s algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Intelligent sizing and output prediction techniques for grid-connected photovoltaic system / Shahril Irwan Sulaiman by Sulaiman, Shahril Irwan

    Published 2012
    “…This thesis presents new intelligent-based techniques for sizing and output prediction in grid-connected photovoltaic (GCPV) system. Initially, two intuitive-based sizing algorithms for GCPV system design, termed as Conventional Sizing Algorithm (CSA), were developed based on two design goals. …”
    Get full text
    Get full text
    Book Section
  17. 17
  18. 18

    Neighbour-based on-demand routing algorithms for mobile ad hoc networks by Ejmaa, Ali Mohamed E.

    Published 2017
    “…All the three proposed algorithms are evaluated using discrete event simulation, in particular Network Simulator tool (NS2), and compared with the latest routing algorithm (NCPR ) and fundamental algorithm (AODV) using five performance metrics. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Density based subspace clustering: a case study on perception of the required skill by Rahmat Widia, Sembiring

    Published 2014
    “…In the early stage, the present research estimates density dimensions and the results are used as input data to determine the initial cluster based on density connection, using DBSCAN algorithm. …”
    Get full text
    Get full text
    Thesis