Search Results - (( its application graph algorithm ) OR ( java application using algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…Thus, the A* algorithm is implemented in a small mobile robot, this is to see its effectiveness in real world application. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
    Get full text
    Get full text
    Final Year Project
  9. 9

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…Although the swmcan algorithm solves the noise problem in multi-view data, its initial and final graphs are independent and cannot learn from each other. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14

    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

    Published 2016
    “…MVC and MIS are notable for its capability of modelling other combinatorial problems and real-world applications. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

    Published 2017
    “…Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18
  19. 19

    Real-Time Video Processing Using Native Programming on Android Platform by Saipullah, Khairul Muzzammil

    Published 2012
    “…However for the Android platform that based on the JAVA language, most of the software algorithm is running on JAVA that consumes more time to be compiled. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20