Search Results - (( solution using minimum algorithm ) OR ( java location based algorithm ))

Search alternatives:

Refine Results
  1. 1
  2. 2

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…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
  3. 3

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…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
  4. 4
  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

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

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

    Published 2018
    “…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
  8. 8

    Loss reduction in distribution networks using new network reconfiguration algorithm by Kashem, M.A., Moghavvemi, M., Mohamed, A., Jasmon, G.B.

    Published 1996
    “…The solution algorithm for loss minimization has been developed based on the two stage solution methodology. …”
    Get full text
    Article
  9. 9
  10. 10

    Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

    Published 2017
    “…However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore we included simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
    Get full text
    Get full text
    Article
  11. 11

    Garbage truck staff duty roster using genetic algorithm / Nadea Suneeza Zulkifli by Zulkifli, Nadea Suneeza

    Published 2017
    “…The solution that had being used is three-dimensional array chromosome structure to represent each schedule. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Scheduling scientific workflow in multi-cloud: a multi-objective minimum weight optimization decision-making approach by Farid, Mazen, Heng, Siong Lim, Chin, Poo Lee, Latip, Rohaya

    Published 2023
    “…In this study, the Pareto front is calculated using a novel multi-objective minimum weight approach. …”
    Get full text
    Get full text
    Article
  14. 14

    Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

    Published 2009
    “…However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  15. 15
  16. 16

    Multi-floor indoor location estimation system based on wireless local area network by Chua, Tien Han

    Published 2007
    “…The most probable match is selected and returned as estimated location based on Bayesian filtering algorithm. Estimated location is reported as physical location and symbolic location. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

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

    Published 2016
    “…Experimental results demonstrate that the proposed algorithms (Min- Diff, Max-Average and ELB) are able to produce good quality solution when compared with the existing algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

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

    Proportional-integral control optimization using imperialist competitive algorithm by Soheilirad, Mohammadsoroush

    Published 2012
    “…A suitable tuning technique is needed for a wide range of control loops that can tune the PID controller with minimum cost, the highest of reliability and with optimum solution. …”
    Get full text
    Get full text
    Thesis