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

Refine Results
  1. 1
  2. 2

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

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

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

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

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

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

    A web-based implementation of k-means algorithms by Lee, Quan

    Published 2022
    “…The project was planned using the Kanban development methodology, and was built using HTML, CSS, JavaScript, Django, NumPy and pandas. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  10. 10

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

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The development of this project is based on a framework of 5 main stages: planning, analysis, design, implementation and testing. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

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

    Published 2019
    “…This methodology consist of Requirement and Planning, Design, Construction, Testing and Implementation. …”
    Get full text
    Get full text
    Thesis
  15. 15

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

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

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

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

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis