Search Results - (( java implementation path algorithm ) OR ( based computing knowing 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
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    How are exponents used in real-world situations? / Nurul Aityqah Yaacob by Yaacob, Nurul Aityqah

    Published 2023
    “…You also need to understand the logic behind algorithms and the order of the number system. Students typically multiply the base by the exponent, for instance, while computing the numerical value of an exponential equation. …”
    Get full text
    Get full text
    Monograph
  11. 11

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

    Published 2015
    “…On the other hand, agent-based model offers a good method to solve complex computational problems. …”
    Get full text
    Get full text
    Thesis
  12. 12

    SVD-based signal detector for cognitive radio networks by Omar, Mohd. Hasbullah, Hassan, Suhaidi, Amphawan, Angela, Awang Nor, Shahrudin

    Published 2011
    “…This paper examines the implementation of the Singular Value Decomposition (SVD) method to detect the presence of wireless signal.The method is used to find the maximum and minimum eigenvalues.We simulated the algorithm using common digital signal in wireless communication namely rectangular pulse shape, raised cosine and root-raised cosine to test the performance of the signal detector.The SVD-based signal detector was found to be more efficient in sensing signal without knowing the properties of the transmitted signal.The execution time is acceptable compared to the favorable energy detection.The computational complexity of SVD-based detector is medium compared to the energy detector.The algorithm is suitable for blind spectrum sensing where the properties of the signal to be detected are unknown. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13
  14. 14

    A quick gbest guided artificial bee colony algorithm for stock market prices prediction by Shah, Habib, Tairan, Nasser, Garg, Harish, Ghazali, Rozaida

    Published 2018
    “…In this respect, in the present manuscript, we propose an algorithm based on ABC to minimize the error in the trend and actual values by using the hybrid technique based on neural network and artificial intelligence. …”
    Get full text
    Get full text
    Article
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20