Search Results - (( java implementation path algorithm ) OR ( user computing best 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

    The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi by Mohd Radzi, Mohamad Khairul Ikhwan

    Published 2017
    “…In other words, dijkstra algorithm used to find the best route to arrive at the every company that are related for this project. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…For the result, Djikstra’s algorithm will find the shortest path towards the desired restaurants regarding to the user current locations besides the system will also generate map towards the locations.…”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9
  10. 10
  11. 11

    Making location-aware computing working accurately in smart spaces by Mantoro, Teddy, Ayu, Media Anugerah, Weyn, Maarten

    Published 2011
    “…The best candidate to determine a user location in indoor environment is by using IEEE 802.11 (Wi-Fi) signals, since it is more and more widely available and installed on most mobile devices used by users. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  12. 12

    Food tour recommendation using modified ant colony algorithm by Sriphaew, Kritsada, Sombatsricharoen, Kannita

    Published 2015
    “…Food tour is popular and becomes one of the most dynamic and creative segments of tourism.Popular itinerary of food tour can be extracted from the information in the Internet, but preference of the user must also be taken into consideration.This paper proposed a modified Ant Colony algorithm to find best possible itineraries through approximation and heuristic method by taking majority preferences of users into account when computing the recommended itinerary.The experiments were conducted on a food tour of restaurants in Yaowarat, a Bangkok’s China-town of Thailand.The results show that our proposed algorithm can recommend itineraries with rank-accuracy 0.88-0.97, which is better than the original Ant Colony algorithm with rank-accuracy 0.61-0.63.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20