Search Results - (( its application ((bees algorithm) OR (_ algorithm)) ) OR ( based application graph 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
    “…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
  6. 6
  7. 7
  8. 8

    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
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14

    Bees algorithm for Forest transportation planning optimization in Malaysia by Jamaluddin, Jamhuri, Kamarudin, Norizah, Ismail, Mohd Hasmadi, Ahmad, Siti Azfanizam

    Published 2021
    “…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
    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

    Performance Enhancement Of Artificial Bee Colony Optimization Algorithm by Abro, Abdul Ghani

    Published 2013
    “…Artificial Bee Colony (ABC) algorithm is a recently proposed bio-inspired optimization algorithm, simulating foraging phenomenon of honeybees. …”
    Get full text
    Get full text
    Thesis
  19. 19

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

    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