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

Search alternatives:

Refine Results
  1. 1
    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm

    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

    Published 2020
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.

    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
    Save to List
    Saved in:
  3. 3
    Multiregion segmentation of mammogram images by using parametric kernel graph cut algorithm / Nurhanani Abdul Rahim, Nor Farah Nabilah Mushtafa and Nadhirah Afiqah Zailan

    Multiregion segmentation of mammogram images by using parametric kernel graph cut algorithm / Nurhanani Abdul Rahim, Nor Farah Nabilah Mushtafa and Nadhirah Afiqah Zailan by Abdul Rahim, Nurhanani, Mushtaf, Nor Farah Nabilah, Zailan, Nadhirah Afiqah

    Published 2019
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  4. 4
    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri

    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
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  5. 5
    Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem

    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
    Save to List
    Saved in:
  6. 6
    Performance analysis of graph heuristics and selected trajectory metaheuristics on examination timetable problem

    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
    Save to List
    Saved in:
  7. 7
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    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
    Save to List
    Saved in:
  8. 8
    Hybrid bat algorithm for minimum dominating set problem

    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
    Save to List
    Saved in:
  9. 9
    Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics

    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
    Save to List
    Saved in:
  10. 10
    Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail

    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
    Save to List
    Saved in:
  11. 11
    A hybrid local search algorithm for minimum dominating set problems

    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
    Save to List
    Saved in:
  12. 12
    A hybrid local search algorithm for minimum dominating set problems

    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
    Save to List
    Saved in:
  13. 13
    A web-based implementation of k-means algorithms

    A web-based implementation of k-means algorithms by Lee, Quan

    Published 2022
    “…The project was planned using the Kanban development methodology, and was built using HTML, CSS, JavaScript, Django, NumPy and pandas. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  14. 14
    Attack path selection optimization with adaptive genetic algorithms

    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
    Save to List
    Saved in:
  15. 15
    Attack path selection optimization with adaptive genetic algorithms

    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
    Save to List
    Saved in:
  16. 16
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The development of this project is based on a framework of 5 main stages: planning, analysis, design, implementation and testing. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…This methodology consist of Requirement and Planning, Design, Construction, Testing and Implementation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling

    Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling by Shimailawi, Shatha Abdulhadi Muthana

    Published 2022
    “…The IEEE RTS 26, 32 and 36-unit dataset systems were used in the performance evaluation of the PACS algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar

    Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar by Vijyakumar, Kanendra Naidu

    Published 2015
    “…The edge reduction algorithm is initially applied to reduce the search space to obtain the initial solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: