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

    Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

    Published 2015
    “…Four agents have been proposed as an agent based model for CPS, which are User_Agent, PAC_Agent, IPO_Agent and Algorithm_Agent. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Improved rsync algorithm to minimize communication cost using multi-agent systems for synchronization in multi-learning management systems by Mwinyi, Amir Kombo

    Published 2017
    “…This algorithm involves several agents, such as: initiator, sense_agent (SA), log_agent (LA), and search_agent (SeA). …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…In addition, a graph algorithm based on greedy methods is employed to compute a new set of optimal weighted electronic properties of the fullerenes via computing their Minimum Weight Spanning Trees (MWSTs). …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14
  15. 15

    Decentralized traffic signal control for grid traffic network using genetic algorithm by Min Keng Tan, Helen Sin Ee Chuo, Kiam Beng Yeo, Renee Ka Yin Chin, Sha Huang, Kenneth Tze Kin Teo

    Published 2019
    “…This work aims to explore the potential to minimize traffic congestion using a non-deterministic algorithm. Conventionally, the deterministic algorithm such as fuzzy logic was proposed as the computational algorithm to compute the optimum traffic signal timing for minimizing vehicles in queue and travel delay. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  16. 16
  17. 17
  18. 18

    Development of gene motif modulation for information processing in artificial DNA computing by Shamsudin, Ahmad Faizul, Suhaimi, Mohd Adam, Ibrahim Ali , Noorbatcha, Hussin, Ummu Salamah, A. F., Alya Khadijah, D., Nor Hidayah

    Published 2014
    “…In the artificial DNA computing model, the MAS (Multi-Agent System) algorithm depicts the sender agent transmits moleware information through the control agent which is then converted to binary data as input to the receiver agent. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  19. 19
  20. 20