Search Results - (( wave application new algorithm ) OR ( its application graph algorithm ))*

Refine Results
  1. 1

    An Accurate and Efficient Shooting-and-bouncing-polygon Ray Tracer For Radio Propagation Modelling by Teh, Chin Hui

    Published 2019
    “…We have described the associated problems and proposed an algorithm to perform the transformation or projection.Thirdly, we have proposed a new spatial partitioning scheme to be used with the SBP ray tracer. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6

    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
  7. 7

    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
  8. 8
  9. 9
  10. 10
  11. 11

    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
  12. 12

    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
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17

    Random traveling wave pulse coupled oscillator (RTWPCO) algorithm of energy-efficient wireless sensor networks by Al-Mekhlafi, Zeyad Ghaleb Aqlan, Mohd Hanapi, Zurina, Othman, Mohamed, Ahmad Zukarnain, Zuriati, Shamsan Saleh, Ahmed M.

    Published 2018
    “…To avert this problem, this study proposes a new mechanism called random traveling wave pulse-coupled oscillator algorithm, which is a self-organizing technique for energy-efficient wireless sensor networks using the phase-locking traveling wave pulse-coupled oscillator and random method on anti-phase of the pulse-coupled oscillator model. …”
    Get full text
    Get full text
    Article
  18. 18

    Dynamical fuzzy autocatalytic set of combustion process in circulating fluidized bed boiler using transition matrix / Hazwani Hashim by Hashim, Hazwani

    Published 2014
    “…Thus it leads to the establishment of an improvised Graph Dynamics Algorithm which is used to assist the analysis of graph dynamics of FACS in CFB. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20