Search Results - (( solution connection _ algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    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
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    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
    Save to List
    Saved in:
  4. 4
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    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
    Save to List
    Saved in:
  5. 5
    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan

    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
    Save to List
    Saved in:
  6. 6
    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…In this paper, we present a routing algorithm based on enhanced simulated annealing technique to provide the connection between nodes in a semi-diagonal torus (SD-Torus) network. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Implication of image processing algorithm in remote sensing and GIS applications

    Implication of image processing algorithm in remote sensing and GIS applications by Pathan, Mubeena, Jusoff, Kamaruzaman, Mohd Sood, Alias, Razali, Yaakob, Qureshi, Barkatullah

    Published 2011
    “…Greedy algorithms expresses as a simple solution algorithm that choose a local optimum solution at each step to achieve a global optimum. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    An Adaptive Switching Cooperative Source Searching And Tracing Algorithms For Underwater Acoustic Source Localization

    An Adaptive Switching Cooperative Source Searching And Tracing Algorithms For Underwater Acoustic Source Localization by Majid, Mad Helmi Ab.

    Published 2019
    “…In this study, a complete solution to the two scenarios through an adaptive algorithm switching strategy is explored. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    A new approach for convert multiply-connected trees in Bayesian networks

    A new approach for convert multiply-connected trees in Bayesian networks by Hussein, Baloochian, Alireza, Khantimoory, Saeed, Balochian

    Published 2009
    Get full text
    Working Paper
    Save to List
    Saved in:
  10. 10
    Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique

    Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

    Published 2006
    “…Each of these agents is connected directly to a different scheduling server. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Coverage and connectivity maximization for wireless sensor networks using improved chaotic grey wolf optimization

    Coverage and connectivity maximization for wireless sensor networks using improved chaotic grey wolf optimization by Shaikh, Muhammad Suhail, Wang, Chang, Xie, Senlin, Zheng, Gengzhong, Dong, Xiaoqing, Qiu, Shuwei, Mohd Ashraf, Ahmad, Raj, Saurav

    Published 2025
    “…This study presents an Improved Chaotic Grey Wolf Optimization (ICGWO) algorithm to enhance WSN coverage and connectivity while addressing challenges like high deployment costs, limited coverage, and insufficient connectivity. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method

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

    Published 2018
    “…Therefore, developing a shortest path based routing algorithm is in need. 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
    Save to List
    Saved in:
  13. 13
    Routing problem in rectangular mesh network using shortest path based Greedy method

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

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. 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
    Save to List
    Saved in:
  14. 14
    Fast ZeroY algorithm for efficient message routing in optical multistage interconnection networks

    Fast ZeroY algorithm for efficient message routing in optical multistage interconnection networks by Raja Mohd Auzar, Tengku Dian Shahida, Othman, Mohamed, Abdullah, Mohamad Khazani

    Published 2008
    “…It is shown that the new algorithm successfully improved the execution time in comparison to the original Zero algorithm.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm

    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

    Published 2020
    “…However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore, we included the Simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Handoff Scheme for Terrestrial Mobile and Satellite Convergence Networks with Incorporation of Pattern Recognition Algorithm

    Handoff Scheme for Terrestrial Mobile and Satellite Convergence Networks with Incorporation of Pattern Recognition Algorithm by Kwong, Chiew Foong

    Published 2009
    “…As the communication becomes a global affair today, engineers had begin to look into the heterogeneous network solution for faster and cheaper deployment. For heterogeneous network to function properly, efficient and effective mobility management is vital to ensure uninterruptable and ubiquitous connection. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    An efficient network mobility management for a 6LoWPAN mobile network in hospital environments

    An efficient network mobility management for a 6LoWPAN mobile network in hospital environments by Shahamabadi, Mohammadreza Sahebi

    Published 2017
    “…Simulation results show that the proposed solution reduces traffic congestion at MR by using the HWSN6 handover solution and the message-scheduling algorithm in the tunnelling process. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    A wireless interference-aware internet-of-things gateway placement framework with genetic algorithm approach

    A wireless interference-aware internet-of-things gateway placement framework with genetic algorithm approach by Kong, Zan Wai

    Published 2022
    “…The framework generates the solution using genetic algorithm. Our experimental results show that solution can be generated with relatively low processing power even for a relatively wide search space. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  19. 19
    Routing problem in rectangular mesh network using shortest path based Greedy method

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

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. 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
    Save to List
    Saved in:
  20. 20
    Secured Autonomous Agent-Based Intrusion Detection System (SAAIDS)

    Secured Autonomous Agent-Based Intrusion Detection System (SAAIDS) by Luqmanulhakim Mohd Nasir

    Published 2024
    thesis::master thesis
    Save to List
    Saved in:

Search Tools: