Search Results - (( using combination graph algorithm ) OR ( java application learning algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

    Evaluation of Visual Network Algorithms on Historical Documents by Khairunnisa, Binti Ibrahim

    Published 2020
    “…The framework has been used to evaluate three graph layout and three graph clustering algorithms on the historical SAGA dataset. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    An improved directed random walk framework for cancer classification using gene expression data by Seah, Choon Sen

    Published 2020
    “…This directed graph is the combination between KEGG pathway and PPI network and named as walker network. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2016
    “…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner by Salleh Muner, Nur Nabilah

    Published 2019
    “…The greedy algorithm was used to color the graph and it was supported by the C++ program. …”
    Get full text
    Get full text
    Research Reports
  7. 7

    Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob by Yaacob, Siti Hajar

    Published 2014
    “…The fitness function calculates based on the total sales of the quantity product sales by week. The crossover are combines all the week to make other population. The main purpose of this research to test whether Genetic Algorithm can use to predict future sales and be able generates the graph. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Stereo Matching Algorithm Based On Per Pixel Difference Adjustment, Iterative Guided Filter And Graph Segmentation by Hamzah, Rostam Affendi, Ibrahim, Haidi, Abu Hassan, Anwar Hasni

    Published 2017
    “…Second, a new approach of iterative guided filter is introduced at cost aggregation to preserve and improve the object boundaries. The undirected graph segmentation is used at the last stage in order to smoothen the low textured areas. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Static and dynamic graphs modeling of a boiler system / Noor Ainy Harish by Harish, Noor Ainy

    Published 2015
    “…These results lead to the development of the third graph which represent a combination of the two processes in the boiler. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Published 2010
    “…Paths are produced by Path-Growing and they are combined into a spanning tree by Tree-Forming. The spanning tree that is produced from the connected graph is then transformed into single-row network using Tree Sequence Modeling (TSM). …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12
  13. 13

    Computational comparison of major proposed methods for graph partitioning problem by Rais, H.M., Abed, S.A., Watada, J.

    Published 2019
    “…The approximate methods constitute a useful solution for these types of problems. Thus, many research studies have focused on developing meta-heuristic algorithms to tackle the graph partitioning problem. …”
    Get full text
    Get full text
    Article
  14. 14

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

    Application of computer based simulation in gas network system using graph theory algorithms and numerical methods by Poh, Hong Hwee

    Published 2007
    “…This is causing the other graph theory algorithms remain least known to users. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Performance analysis of graph heuristics and selected trajectory metaheuristics on examination timetable problem by Mandal, Ashis Kumar, Mohd Nizam Mohmad, Kahar

    Published 2020
    “…In this paper, we present the combination of graph heuristics and major trajectory metaheuristics for addressing both capacitated and un-capacitated examination timetabling problem. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

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

    Published 2009
    “…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…The graph coloring heuristics were set as individual, combination of three heuristics. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20