Search Results - (( its application ((graph algorithm) OR (acs algorithm)) ) OR ( _ application a algorithm ))*

Refine Results
  1. 1

    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
  2. 2
  3. 3
  4. 4

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

    Published 2024
    “…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
    Get full text
    Get full text
    Thesis
  5. 5

    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
    “…The aim of this paper is twofold: first to investigate failures of the state-of- the-art algorithms for MVC problem on small graphs and second to propose a simple and efficient approximation algorithm for the minimum vertex cover problem. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7

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

    Published 2017
    “…The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. 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
  8. 8
  9. 9
  10. 10
  11. 11

    A multi-objective Spiral Dynamic algorithm and its application for PD design by Ahmad Nor Kasruddin, Nasir, Mohd Ashraf, Ahmad, A. R.A., Azwan, Mohd Falfazli, Mat Jusof

    Published 2017
    “…In terms of its application in solving a real problem, both algorithms successfully optimize the PD and control the system very well. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…In MPIDS, the aim is to identify a subset of vertices where each vertex of a graph must be dominated by at least half of its neighbors. …”
    Get full text
    Get full text
    Article
  13. 13

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…In MPIDS, the aim is to identify a subset of vertices where each vertex of a graph must be dominated by at least half of its neighbors. …”
    Get full text
    Get full text
    Article
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18

    Aco-based feature selection algorithm for classification by Al-mazini, Hassan Fouad Abbas

    Published 2022
    “…However, the MGCACO algorithm has three main drawbacks in producing a features subset because of its clustering method, parameter sensitivity, and the final subset determination. …”
    Get full text
    Get full text
    Thesis
  19. 19

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