Search Results - (( java implementation case algorithm ) OR ( problem implementation graph algorithm ))

Refine Results
  1. 1

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
    Get full text
    Get full text
    Thesis
  2. 2

    An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R., Sammi, R.

    Published 2010
    “…The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.…”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
    Get full text
    Get full text
    Thesis
  4. 4

    An enumerative algorithm for the maximum clique problem by Mustafa, Mamat, Suyudi, M., Sukono, ., Bon, A.T.

    Published 2019
    “…Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

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

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

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

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

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
  9. 9

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

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

    Published 2008
    “…Quantum computing algorithms are considered for several problems in graph theory. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Bipartite graph approach to course timetabling problems / Hafizah A Razak by A Razak, Hafizah

    Published 2009
    “…Future research also can be carried out on the timetabling problems implementing other approaches.…”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

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

    Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

    Published 2016
    “…The entire process runs until all of the examinations are assigned successfully. We have implemented partial graph heuristic with hill climbing (PGH-HC) and partial graph heuristic with modified great deluge algorithm (PGH-mGD) into solving the examination timetabling. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

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

    Combination of Graph Heuristic with Hill Climbing Search for Solving Capacitated Examination Timetabling Problem by Ashis Kumar, Mandal, M. N. M., Kahar

    Published 2015
    “…The algorithm starts with ordering all the exams according to graph heuristic approach and then partial exams are considered for construction. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20