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

Refine Results
  1. 1
  2. 2

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

    Published 2018
    “…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
    Get full text
    Get full text
    Final Year Project
  3. 3
  4. 4
  5. 5

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

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

    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
  11. 11
  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
    “…For the second stage, we propose a gain-based deterministic local search algorithm as an exploitation procedure. …”
    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
    “…For the second stage, we propose a gain-based deterministic local search algorithm as an exploitation procedure. …”
    Get full text
    Get full text
    Article
  14. 14
  15. 15

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

    Published 2022
    “…An enhanced graph clustering ant colony optimisation (EGCACO) algorithm is proposed to solve the three (3) MGCACO algorithm problems. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

    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
    “…A Non-dominated sorting (NS) approach from Non-dominated Sorting Genetic Algorithm II (NSGAII) is adopted into SDA to develop its multi-objective (MO) type algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences by M. Othman, Razib, Deris, Safaai, Md. IIlias, Rosli

    Published 2008
    “…To show the applicability of the basic UTMGO, we extend its structure to develop a Gene Ontology -based protein sequence annotation tool named extended UTMGO. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20