Search Results - (( java implementation among algorithm ) OR ( problem using minimum algorithm ))

Search alternatives:

Refine Results
  1. 1
    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
    “…Many algorithms have been implemented to solve the grid scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    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:
  4. 4
    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:
  5. 5
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    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 we considered finding minimum path problem which is known as shortest path problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    A Toolkit for Simulation of Desktop Grid Environment

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…A simulator for desktop grid environment has been developed using Java as the implementation language due to its wide popularity. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  8. 8
    Firefly algorithm: Minimizing cost on single-level lot-sizing problem / Siti Hafawati Jamaluddin ... [et al.]

    Firefly algorithm: Minimizing cost on single-level lot-sizing problem / Siti Hafawati Jamaluddin ... [et al.] by Jamaluddin, Siti Hafawati, Zulkipli, Nurul Azleeka, Mahmud, Norwaziah, Muhamat Pazil, Nur Syuhada

    Published 2018
    “…From the problem emerge, the minimum of production cost is determined by using firefly algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem

    Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem by Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad

    Published 2015
    “…The Multi Periods Degree Constrained Minimum Spanning Tree Problem (MPDCMST) is a problem that concerns about finding a minimum networks installations for a certain commodity so that the networks does not violate the reliability restriction whilst also satisfying the fund limitation in every stages of installations. …”
    Get full text
    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
    “…In the first stage, we propose an adaptive information content-based local search algorithm as an exploratory procedure. 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 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
    “…In the first stage, we propose an adaptive information content-based local search algorithm as an exploratory procedure. 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:
  14. 14
    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:
  15. 15
    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
    “…Hence, we propose a stochastic approach to tackle the minimum dominating set problem (MDS). The main aim of MDS is to find the minimum number of nodes that covers all other nodes in a graph. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    A genetic algorithm for solving single level lotsizing problems

    A genetic algorithm for solving single level lotsizing problems by Zenon, Nasaruddin, Ahmad, Ab. Rahman, Ali, Rosmah

    Published 2003
    “…Thus, stochastically-based heuristics that have the mechanism to escape from local minimum are needed. In this paper a genetic algorithm for solving single level lot-sizing problems is proposed and the results of applying the algorithm toexample problems are discussed. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    On network flow problems with convex cost

    On network flow problems with convex cost by Nguyen, V.A., Tan, Y. P.

    Published 2004
    “…To address this problem, we derive the optimality conditions for minimising convex and differentiable cost functions, and devise an algorithm based on the primal-dual algorithm commonly used in linear programming. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Solving economic load dispatch problem using genetic algorithm method / Norliza Kamarulzaman

    Solving economic load dispatch problem using genetic algorithm method / Norliza Kamarulzaman by Kamarulzaman, Norliza

    Published 2009
    “…In this study, Genetic Algorithm method is used to overcome this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    A memory-based gravitational search algorithm for enhancing minimum variance distortionless response beamforming

    A memory-based gravitational search algorithm for enhancing minimum variance distortionless response beamforming by Darzi S., Sieh Kiong T., Tariqul Islam M., Rezai Soleymanpour H., Kibria S.

    Published 2023
    Article
    Save to List
    Saved in:
  20. 20
    Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing

    Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing by Elteriki, Salem Abdulsalam

    Published 2018
    “…However, not many types of research are focused on the study of the 2SALB problem. Recently, the artificial bee colony (ABC) algorithm was used in the solution process where it was considered as a very useful, effective and well-known algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: