Search Results - some ((((drop algorithm) OR (tree algorithm))) OR (graph algorithm))

Refine Results
  1. 1

    A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2008
    “…Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a graph. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Spanning Tree Transformation of Connected Graph into Single-Row Network by Loh, Ser Lee, Salleh, Shaharuddin, Sarmin, Nor Haniza

    Published 2010
    “…A spanning tree of a connected graph is a tree which consists the set of vertices and some or perhaps all of the edges from the connected graph. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3
  4. 4

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
    Get full text
    Article
  5. 5

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Analysis and modeling of database storage optimization power consumption usage for green data centers by Wan Noor Hamiza, Wan Ali

    Published 2014
    “…This technique requires proxy candidate in order to drop some attribute for decrease the space storage. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    An empirical study of pattern leakage impact during data preprocessing on machine learning-based intrusion detection models reliability by Bouke, Mohamed Aly, Abdullah, Azizol

    Published 2023
    “…Additionally, we find that some algorithms are more sensitive to data leakage than others, as seen by the drop in model accuracy when built without leakage. …”
    Get full text
    Get full text
    Article
  8. 8

    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

    Published 2016
    “…Furthermore, the ‘snowflake’ geometrical representation was proposed to illustrate the connectivity of nodes in CHR6o3 as well as to aid the proving of some properties involving its Hamiltonicity. The results of this research are important in developing a routing algorithm for CHR6o3.…”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    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
    “…The researchers develop a graph coloring algorithm by considering some of the graph vertices to be binary numbers. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Evaluating Layout and Clustering Algorithms for Visualizing Named Entity Graph by Ibrahim, K., Ranaivo-Malançon, Bali, Lim, T., Cheah, Y.N.

    Published 2017
    “…Myriad of layout and clustering algorithms exist to generate visual graphs of named entities. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop by Mohd Yakop, Mohammad Arsyad

    Published 2017
    “…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Indoor occupancy detection using machine learning and environmental sensors / Akindele Segun Afolabi ... [et al.] by Afolabi, Akindele Segun, Akinola, Olubunmi Adewale, Odetoye, Oyinlolu Ayomidotun, Adetiba, Emmanuel

    Published 2025
    “…This is important because the activities of human subjects in an ML environment are capable of disrupting the data available to some deployed ML models, which might cause the performance of such models to drop. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
    Get full text
    Get full text
    Thesis
  14. 14

    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akhbar, R.

    Published 2010
    “…The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node.…”
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2021
    “…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Student Project
  17. 17

    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2022
    “…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Research Reports
  18. 18

    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
    “…In this paper, we have introduced small benchmark instances and some state of the art algorithms (MDG, VSA, and MVSA) have been tested along with the proposed algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Che, Yahaya, Roslina, Abdul Hamid

    Published 2018
    “…Recent high-throughput experiments have generated protein-protein interaction data on a genomic scale, yielding the complete protein-protein interaction network for several organisms. Various graph clustering algorithms have been applied to protein interaction networks for detecting protein functional modules. …”
    Get full text
    Get full text
    Get full text
    Article