Search Results - (( java implementation learning algorithm ) OR ( using work graph algorithm ))

Search alternatives:

Refine Results
  1. 1
    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm

    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
    Save to List
    Saved in:
  2. 2
    Accelerating graph algorithms with priority queue processor

    Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

    Published 2006
    “…In this work, we demonstrate how to accelerate graph algorithms using priority queue processor. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    An improved algorithm for channel allocation on direct sequence spread spectrum

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics

    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

    Published 2023
    “…The attack graph is categorized into three sections: generation, analysis, and use of attack graph. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    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
    “…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
    Save to List
    Saved in:
  6. 6
    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri

    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
    Save to List
    Saved in:
  7. 7
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Implement edge pruning to enhance attack graph generation using the naïve approach algorithm

    Implement edge pruning to enhance attack graph generation using the naïve approach algorithm by Al-Araji, Zaid J., Mutlag, Ammar Awad, Syed Ahmad, Sharifah Sakinah

    Published 2024
    “…The attack graph is categorized into three sections: generation, analysis, and use of attack graph. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    An Educational Tool Aimed at Learning Metaheuristics

    An Educational Tool Aimed at Learning Metaheuristics by Kader, Md. Abdul, Jamaluddin, Jamal A., Kamal Z., Zamli

    Published 2020
    “…Implemented with Java, this tool provides a friendly GUI for setting the parameters and display the result from where the learner can see how the selected algorithm converges for a particular problem solution. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde

    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

    Published 2022
    “…The method was implemented using Java and the results of the simulation were evaluated using five standard performance metrics: accuracy, AUC, precision, recall, and f-Measure. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A Feature Ranking Algorithm in Pragmatic Quality Factor Model for Software Quality Assessment

    A Feature Ranking Algorithm in Pragmatic Quality Factor Model for Software Quality Assessment by Ruzita, Ahmad

    Published 2013
    “…The methodology used consists of theoretical study, design of formal framework on intelligent software quality, identification of Feature Ranking Technique (FRT), construction and evaluation of FRA algorithm. The assessment of quality attributes has been improved using FRA algorithm enriched with a formula to calculate the priority of attributes and followed by learning adaptation through Java Library for Multi Label Learning (MULAN) application. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi

    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi

    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

    Published 2012
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    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:
  15. 15
    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:
  16. 16
    Dissimilarity algorithm on conceptual graphs to mine text outliers

    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
    Save to List
    Saved in:
  17. 17
    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm

    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

    Published 2012
    “…Graph colouring is a useful algorithm for channel allocation on wireless local area network (WLAN). …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    An analysis of the effect of heterogeneously distributed inertia constant in generation mix power system by using the graph theory and Dijkstra’s Algorithm

    An analysis of the effect of heterogeneously distributed inertia constant in generation mix power system by using the graph theory and Dijkstra’s Algorithm by Harshada Nerkar, Kundu, Prasanta, Chowdhury, Anandita

    Published 2023
    “…In this paper, we calculate the shortest path between the nodes or substations by using Dijkstra’s algorithm. The betweenness centrality of the node detects the vulnerable nodes in the system from the frequency response point of view.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Stereo Matching Algorithm Based On Per Pixel Difference Adjustment, Iterative Guided Filter And Graph Segmentation

    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
    “…The absolute differences (AD) algorithms work fast, but they are too sensitive to noise and low textured areas. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    The construction of distinct circuits of length six for complete graph K6

    The construction of distinct circuits of length six for complete graph K6 by Mohd Darus, Maizon, Ibrahim, Haslinda, Karim, Sharmila

    Published 2015
    “…The emergent applications of complete graph in diverse domains have invited numerous works in this subject matter.Studies related to the decomposition of complete graph such as one-factor, several ɳ-gons and Cartesian product have been solved.Yet, the decomposition of complete graph into distinct circuits still has not been done.Thus, this paper aims to investigate the structure of complete graph, and in particular, the decomposing of complete graph of length six.The decomposition algorithm will be presented to enumerate distinct circuits of length six. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: