Search Results - (( java implementation case algorithm ) OR ( using minimum using algorithm ))

Search alternatives:

Refine Results
  1. 1
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    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
    “…The algorithms were implemented in a Java environment. Results were discussed and analyzed by using formulas and were compared in percentages. …”
    Review
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework

    Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework by Asaad Aref, Ibrahim

    Published 2004
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Pairwise testing tools based on hill climbing algorithm (PTCA)

    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
    Save to List
    Saved in:
  5. 5
    Examination timetabling using genetic algorithm case study: KUiTTHO

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Java based expert system for selection of natural fibre composite materials

    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
    Save to List
    Saved in:
  7. 7
    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions

    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
    Save to List
    Saved in:
  9. 9
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…The only way left is to use the approximation algorithm of Minimum Vertex Cover (MVC) for the solution of the Maximum Clique (MC) problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    SANAsms: Secure short messaging system for secure GSM mobile communication

    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
    Save to List
    Saved in:
  11. 11
    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 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
    Save to List
    Saved in:
  12. 12
    Batch mode heuristic approaches for efficient task scheduling in grid computing system

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Outlier detection in circular regression model using minimum spanning tree method

    Outlier detection in circular regression model using minimum spanning tree method by Nur Faraidah, Muhammad Di, Siti Zanariah, Satari, Roslinazairimah, Zakaria

    Published 2019
    “…Therefore, this study aims to develop new algorithms that can detect outliers by using the minimum spanning tree method. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Finding the shortest route using Dijkstra’s algorithm with application to ride hailing in UiTM Cawangan Negeri Sembilan Kampus Seremban / Nur Husnina Hassan, Nurin Hadrah Syahira Muhamad Bakri and Alya Batrisyia Sazeli

    Finding the shortest route using Dijkstra’s algorithm with application to ride hailing in UiTM Cawangan Negeri Sembilan Kampus Seremban / Nur Husnina Hassan, Nurin Hadrah Syahira M... by Hassan, Nur Husnina, Muhamad Bakri, Nurin Hadrah Syahira, Sazeli, Alya Batrisyia

    Published 2022
    “…Therefore, to find the shortest route with minimum time, Dijkstra's Algorithm will be used. Apart from that, the Dijkstra’s Algorithm used in this study will allow us to find the smallest weight path for all permanently labelled Nod once it has been run. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  15. 15
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

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

    Published 1997
    “…The result will be compared with euler's path algorithm using heuristic search and a pseudo input to find the minimum interlace.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Hybrid Spatial-Artificial Intelligence Approach for Renewable Energy Sources Sites Identification and Integration in Sarawak State

    Hybrid Spatial-Artificial Intelligence Approach for Renewable Energy Sources Sites Identification and Integration in Sarawak State by Far Chen, Jong

    Published 2022
    “…In each case, the Traveling Salesman Problem-Genetic Algorithm (TSP-GA) algorithm is applied to determine a minimum total distance of RES sites integration. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Multi objective optimisation for high speed end milling using simulated annealing algorithm

    Multi objective optimisation for high speed end milling using simulated annealing algorithm by Al Hazza, Muataz Hazza Faizi, Adesta, Erry Yulian Triblas, Shaffiar, Norhashimah, Seder, Amin M. F., Riza, Muhammad

    Published 2015
    “…This paper presents the optimization of machining parameters in end milling processes by using the simulated annealing algorithm (SAA) as one of the unconventional methods in optimization. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    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:
  20. 20
    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:

Search Tools: