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

Search alternatives:

Refine Results
  1. 1
    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION

    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
    Save to List
    Saved in:
  2. 2
    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences

    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  3. 3
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Identification of power poles based on satellite stereo images using graph-cut algorithm

    Identification of power poles based on satellite stereo images using graph-cut algorithm by Qayyum, Abdul, Malik, Aamir Saeed, Mohamad Saad, Mohamad Naufal, Ahmad, Rana Fayyaz, Taun Abdullah, Taun Ab Rashid

    Published 2015
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering

    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
    Save to List
    Saved in:
  6. 6
    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems

    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
    Save to List
    Saved in:
  7. 7
    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm

    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

    Published 2012
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks

    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks by Saqer, Ahmad Sabri Mousa

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs

    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
    Save to List
    Saved in:
  10. 10
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A hybrid local search algorithm for minimum dominating set problems

    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
    Save to List
    Saved in:
  12. 12
    A hybrid local search algorithm for minimum dominating set problems

    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
    Save to List
    Saved in:
  13. 13
    Aco-based feature selection algorithm for classification

    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
    Save to List
    Saved in:
  14. 14
    Ant colony optimization algorithm for load balancing in grid computing

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  15. 15
    A multi-objective Spiral Dynamic algorithm and its application for PD design

    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
    Save to List
    Saved in:
  16. 16
    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences

    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
    Save to List
    Saved in:
  18. 18
    A regression test case selection and prioritization for object-oriented programs using dependency graph and genetic algorithm

    A regression test case selection and prioritization for object-oriented programs using dependency graph and genetic algorithm by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

    Published 2014
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Modified ACS centroid memory for data clustering

    Modified ACS centroid memory for data clustering by Jabbar, Ayad Mohammed, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

    Published 2019
    “…Ant Colony Optimization (ACO) is a generic algorithm, which has been widely used in different application domains due to its simplicity and adaptiveness to different optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Resource management in grid computing using ant colony optimization

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:

Search Tools: