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

Search alternatives:

Refine Results
  1. 1
    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:
  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
    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:
  4. 4
    Application of the bees algorithm for constrained mechanical design optimisation problem

    Application of the bees algorithm for constrained mechanical design optimisation problem by Kamaruddin, Shafie, Abd Latif, Mohd Arif Hafizi

    Published 2019
    Get full text
    Get full text
    Get full text
    Article
    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
    Using the bees algorithm to optimise a support vector machine for wood defect classification

    Using the bees algorithm to optimise a support vector machine for wood defect classification by Pham, D.T, Muhammad, Zaidi, Mahmuddin, Massudi, Ghanbarzadeh, Afshin, Koc, Ebubekir, Otri, Sameh

    Published 2007
    “…This paper describes a new application of the Bees Algorithm to the optimization of a Support Vector Machine (SVM) for the problem of classifying defects in plywood. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Application of the bees algorithm to the selection features for manufacturing data

    Application of the bees algorithm to the selection features for manufacturing data by Pham, D.T, Mahmuddin, Massudi, Otri, S., Al-Jabbouli, H.

    Published 2007
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Bees algorithm enhanced with Nelder and Mead method for numerical function optimisation

    Bees algorithm enhanced with Nelder and Mead method for numerical function optimisation by Kamaruddin, Shafie, Bahari, Muhammad Syahril, Pham, Duc Truong, Mohd Amin Hamzas, Mohd Fidzwan, Zakaria, S

    Published 2019
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Application of Bee Colony Optimization (BCO) in NP-Hard Problems

    Application of Bee Colony Optimization (BCO) in NP-Hard Problems by Kamarudin, Muhammad Sariy Syazwan

    Published 2011
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  10. 10
    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:
  11. 11
    Optimal design of step – cone pulley problem using the bees algorithm

    Optimal design of step – cone pulley problem using the bees algorithm by Yusof, Noor Jazilah, Kamaruddin, Shafie

    Published 2021
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  12. 12
    Application of the Bees Algorithm to find optimal drill path sequence

    Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

    Published 2024
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  13. 13
    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Assembly sequence optimization using the bees algorithm

    Assembly sequence optimization using the bees algorithm by Kamaruddin, Shafie, Azmi, Nabilah, Sukindar, Nor Aiman

    Published 2022
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  15. 15
    Optimisation of Surface Roughness in 3D Printing Using the Bees Algorithm

    Optimisation of Surface Roughness in 3D Printing Using the Bees Algorithm by Kamaruddin, Shafie, Ridzuan, Arman Hilmi, Sukindar, Nor Aiman

    Published 2025
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  16. 16
    Signless laplacian energy of interval-valued fuzzy graph and its applications

    Signless laplacian energy of interval-valued fuzzy graph and its applications by Romdhini, Mamika Ujianita, Al-Sharqi, Faisal, Athirah Nawawi, Al-Quran, Ashraf, Rashmanlou, Hossein

    Published 2023
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    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
    “…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
    Save to List
    Saved in:
  18. 18
    Comparison Between the Bees Algorithm and Genetic Algorithm Model in Manpower Allocation on Cell Loading Problem

    Comparison Between the Bees Algorithm and Genetic Algorithm Model in Manpower Allocation on Cell Loading Problem by AlMahasneh, Hossam Sayel

    Published 2010
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    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
    “…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:
  20. 20
    Combination of adaptive enlargement and reduction in the search neighbourhood in the bees algorithm

    Combination of adaptive enlargement and reduction in the search neighbourhood in the bees algorithm by Ahmad, Siti Azfanizam, Pham, Duc Truong, Abdul Aziz, Faieza

    Published 2014
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: