Search Results - (( using solution graph algorithm ) OR ( java implementation case algorithm ))

Refine Results
  1. 1

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    “…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5
  6. 6
  7. 7

    Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem by Mandal, Ashis Kumar, M. N. M., Kahar

    Published 2020
    “…For constructing the feasible solution, six graph heuristics are used. They are largest degree (LD), largest weighted degree (LWD), largest enrolment degree (LE), and three hybrid heuristic with saturation degree (SD) such as SD-LD, SD-LE, and SD-LWD. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

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

    Published 2020
    “…For constructing the feasible solution, six graph heuristics are used. They are largest degree (LD), largest weighted degree (LWD), largest enrolment degree (LE), and three hybrid heuristics with saturation degree (SD) such as SD-LD, SD-LE, and SD-LWD. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

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

    Published 2009
    “…Results of the experiments that were conducted using various data sets showed that the proposed algorithm produced better course schedule solution than the Greedy Algorithm, Genetic Algorithm, and other variants of Ant System Algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

    Published 2017
    “…However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore we included simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
    Get full text
    Get full text
    Article
  11. 11

    Pairwise testing tools based on hill climbing algorithm (PTCA) by Lim, Seng Kee

    Published 2014
    “…The actual implementation of the algorithm which is in Java programming language, the program is implemented on Net Bean 7.0.1. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  12. 12

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

    Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail by Basri, Siti Nor Ba, Khozaid, Nur Su’aidah, Ismail, Farhana Hazwani

    Published 2023
    “…Different colours are allocated to each vertex using graph colouring techniques such as the vertices algorithm or the edges algorithm, ensuring that clashing courses and lecturers are assigned different time slots. …”
    Get full text
    Get full text
    Student Project
  14. 14
  15. 15

    Java based expert system for selection of natural fibre composite materials by Ahmed Ali, Basheer A., Salit, Mohd Sapuan, Zainudin, Edi Syams, Othman, Mohamed

    Published 2013
    “…In this paper, we develop a technology for the materials selection system using Java based expert system. The weighted-range method (WRM) was implemented to identify the range value and to scrutinise the candidate materials. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
  17. 17

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
  18. 18

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
  19. 19

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
  20. 20