Search Results - (( java implementation case algorithm ) OR ( knowledge using graph 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

    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
    “…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Research Reports
  4. 4

    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
    “…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Student Project
  5. 5

    The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning by Noor, Ubair, Hassan, Raini, Dwi Handayani, Dini Oktarina

    Published 2025
    “…However, not much attention has been paid to issues related to skyline query processing over knowledge of large-scale incomplete graph databases. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  6. 6

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

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

    Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

    Published 2009
    “…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10
  11. 11

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…According to the simulation results, the proposed algorithm produces the best solution among all algorithms in the proposed cases. � 2021 Little Lion Scientific…”
    Review
  12. 12
  13. 13
  14. 14

    Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo

    Published 2022
    “…CS and JA have implemented in the same platform (Intellij IDEA Community Edition 2020.2.3) using the same language (Java). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    SANAsms: Secure short messaging system for secure GSM mobile communication by Anuar, N.B., Azlan, I.M., Wahid, A.W.A., Zakaria, O.

    Published 2008
    “…The system is developed using Java 2 Micro Edition (J2ME) which is written in Java. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Optimizing schedule of boarding school using vertex and edge coloring approach / Nurhuda Ismail, Siti Sarah Raseli and Nur Farhana Mohd Asri by Ismail, Nurhuda, Raseli, Siti Sarah, Mohd Asri, Nur Farhana

    Published 2021
    “…Greedy Algorithm has been used to solve the Vertex Coloring approach while Graph Coloring Algorithm has been used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

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

    Published 2019
    “…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Automatic clustering of gene ontology by genetic algorithm by Othman, Razib M., Deris, Safaai, Zakaria, Zalmiyah, Illias, Rosli M., Mohamad, Saberi M.

    Published 2006
    “…Clustering the Gene Ontology is a difficult combinatorial problem and can be modeled as a graph partitioning problem. Additionally, deciding the number k of clusters to use is not easily perceived and is a hard algorithmic problem. …”
    Get full text
    Get full text
    Article