Search Results - (( _ constructability graph algorithm ) OR ( java data optimization algorithm ))

Refine Results
  1. 1
  2. 2

    An algorithm for constructing reduced alternating achiral knots by Azram, Mohammad

    Published 2014
    “…Consequently we have established an algorithm to construct reduced alternating achiral knots (links) through the planar graphs.…”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    An algorithm for constructing reduced alternating achiral knots by Azram, Mohammad

    Published 2013
    “…Consequently we have established an algorithm to construct reduced alternating achiral knots (links) through the planar graphs.…”
    Get full text
    Get full text
    Proceeding Paper
  4. 4

    Fuzzy modeling using Bat Algorithm optimization for classification by Noor Amidah, Ahmad Sultan

    Published 2018
    “…A Sazonov Engine which is a fuzzy java engine is use to apply Bat Algorithm in the experiment. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  5. 5

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
    Get full text
    Get full text
    Article
  6. 6

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

    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 minimum color represents the minimum time slots required to construct the new schedule. 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
  8. 8

    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 minimum color represents the minimum time slots required to construct the new schedule. 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
  9. 9
  10. 10

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

    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

    Published 2012
    “…Hybridization uses the array identifying algorithm to identify the sequence. The algorithm used to construct the module is Bruijn Graph. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

    Published 2012
    “…Hybridization uses the array identifying algorithm to identify the sequence. The algorithm used to construct the module is Bruijn Graph. …”
    Get full text
    Get full text
    Article
  13. 13

    A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid... by Mohammad Zahid, Munashahira

    Published 2024
    “…The Reverse-Delete algorithm works in reverse; it starts with the full graph and iteratively removes the largest edges, ensuring that the graph remains connected. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15
  16. 16

    Image matching using relational graph representation by Lai, Chui Yen

    Published 2005
    “…The methodology is consists of six steps: (1) input image, (2) line segment extraction from the image, (3) the interpretation and derivation of structural descriptions from the line-extracted image, (4) the construction of relational graph to represent the structural descriptions, (5) the derivation of association graph from relational graphs to perform relational graph matching, and (6) the searching of the largest maximal clique in the association graph to determine the best matching. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Butterfly Triple System Algorithm Based on Graph Theory by Ibrahim, Haslinda, Aldiabat, Raja’i, Karim, Sharmila

    Published 2022
    “…Basically, in this algorithm development, a starter of cyclic near-resolvable ((v-1)/2)-cycle system of the 2-fold complete graph 2Kvis employed to construct the starter of cyclic ((v-1)/2)-star decomposition of 2Kv. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A random search based effective algorithm for pairwise test data generation by Sabira, Khatun, K. F., Rabbi, Che Yahaya, Yaakub, Klaib, Mohammad F. J.

    Published 2011
    “…This paper proposes an effective random search based pairwise test data generation algorithm named R2Way to optimize the number of test cases. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi by Mohd Rafi, Hafifi

    Published 2012
    “…There is several algorithms use in sequencing of DNA fragment. This paper presents a study on design and analysis of construction and recombination module using IduryWaterman algorithm and fragment assembly application using Verilog. …”
    Get full text
    Get full text
    Thesis