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

Refine Results
  1. 1
  2. 2

    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

    Published 2022
    “…In this article, the researchers design an algorithm and apply it to a computer program (Python) to solve graph coloring and to visualize the variation of exam scheduling modeling at Binus University in graphs based on the Bitwise Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3
  4. 4

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

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…The analysis and comparison of VIGA-20 is based on convergence test against the results obtained from the Simple Genetic Algorithm. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11

    Scalable workflow scheduling algorithm for minimizing makespan and failure probability by Abdul Aziz, Maslina, Ninggal, Izuan Hafez

    Published 2019
    “…A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  12. 12
  13. 13

    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
    “…Mostly the state of art approximation algorithms for the MVC problem are based on greedy approaches, or inspired from MIS approaches. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…Then, these graph-based structural models of the fullerenes and graph algorithms based on dynamic programming are applied to compute a new set of optimal weighted physical properties of the components including Wiener, hyper-Wiener, Harary and reciprocal Wiener indices as well as Hosoya and hyper-Hosoya polynomials. …”
    Get full text
    Get full text
    Thesis
  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

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

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

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

    Published 2022
    “…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20