Search Results - (( using greedy method algorithm ) OR ( using optimization method algorithm ))

Search alternatives:

Refine Results
  1. 1
    Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly

    Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly by Mohd Suzaly, Muhammad Abu Syah

    Published 2023
    “…The first method is greedy heuristic method. Greedy heuristics is a type of optimization algorithm that makes decisions based on locally optimal solutions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Optimization of the hidden layer of a multilayer perceptron with backpropagation (bp) network using hybrid k-means-greedy algorithm (kga) for time series prediction

    Optimization of the hidden layer of a multilayer perceptron with backpropagation (bp) network using hybrid k-means-greedy algorithm (kga) for time series prediction by Tan, James Yiaw Beng

    Published 2012
    “…The proposed KGA model combines greedy algorithm withk-means++ clustering in this research to assist users in automating the finding of the optimal number of new-ons inside the hidden layer of the BP network. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    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:
  5. 5
    Optimizing schedule of boarding school using vertex and edge coloring approach / Nurhuda Ismail, Siti Sarah Raseli and Nur Farhana Mohd Asri

    Optimizing schedule of boarding school using vertex and edge coloring approach / Nurhuda Ismail, Siti Sarah Raseli and Nur Farhana Mohd Asri by Ismail, Nurhuda, Raseli, Siti Sarah, Mohd Asri, Nur Farhana

    Published 2021
    “…Greedy Algorithm has been used to solve the Vertex Coloring approach while Graph Coloring Algorithm has been used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra’s based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Information Theoretic-based Feature Selection for Machine Learning

    Information Theoretic-based Feature Selection for Machine Learning by Muhammad Aliyu, Sulaiman

    Published 2018
    “…In addition to these problems, the search strategy which is usually a heuristic greedy method used with many existing feature selections, lacks scientifically sound stopping criterion and the forward greedy procedure despite its advantages over the backward procedure is found to reveal suboptimal. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    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 algorithms that were used for experiments are Maximum Degree Greedy (MDG). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Optimality of bus-invert coding

    Optimality of bus-invert coding by Rokhani, Fakhrul Zaman, Kan, Wen Chih, Kieffer, John, Sobelman, Gerald E.

    Published 2009
    “…While the method appears to be a greedy algorithm, we show that it is, in fact, an optimal strategy. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner

    Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner by Salleh Muner, Nur Nabilah

    Published 2019
    “…The greedy algorithm was used to color the graph and it was supported by the C++ program. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  13. 13
    Using artificial intelligence search in solving the camera placement problem

    Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

    Published 2022
    “…In order to solve the camera placement problem, a crucial fundamental step is modeling the coverage of the cameras in use. Following the coverage modeling, an optimization method needs to be used to locate the optimal poses and/or camera positions. …”
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  14. 14
    Input-output based relation combinatorial testing using whale optimization algorithm for generating near optimum number of test suite

    Input-output based relation combinatorial testing using whale optimization algorithm for generating near optimum number of test suite by Suali, Anjila J., Nuraminah Ramli, Rozmie Razif Othman, Hasneeza Liza Zakaria, Iszaidy Ismail, Nor Shahida Mohd Jamail, Rimuljo Hendradi, Nurol Husna Che Rose

    Published 2025
    “…This study proposes a combinatorial testing method utilizing the Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem

    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

    Published 2022
    “…Multidimensional Knapsack Problem (MKP) has been widely used to model real-life combinatorial problems. It is also used extensively in experiments to test the performances of metaheuristic algorithms and their hybrids. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Integration Of Travel Time Zone For Optimal Siting Of Emergency Facilities

    Integration Of Travel Time Zone For Optimal Siting Of Emergency Facilities by Indriasari, Vini

    Published 2008
    “…Fire stations in Jakarta Selatan were chosen for simulation. Two algorithms, Greedy Adding (Add) and Greedy Adding with Travel Time Evaluation (GAT), were applied to solve the optimization problem of the MSAP. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Modeling of static and dynamic components of bio-nanorobotic systems

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…In addition, a graph algorithm based on greedy methods is employed to compute a new set of optimal weighted electronic properties of the fullerenes via computing their Minimum Weight Spanning Trees (MWSTs). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Heuristic resource allocation algorithm for controller placement in multi-control 5G based on SDN/NFV architecture

    Heuristic resource allocation algorithm for controller placement in multi-control 5G based on SDN/NFV architecture by Ibrahim, Abeer Abdalla Zakaria, Hashim, Fazirulhisyam, Noordin, Nor Kamariah, Sali, Aduwati, Navaie, Keivan, Fadul, Saber Mohammed Elnour

    Published 2021
    “…It is based on the K-center problem, to solve the capacitated controller placement problem (CCPP), which acts as a resource location problem, in which the location and number of controllers can be allocated to maximize resources. A Greedy Randomized Search (GRS) algorithm was used to solve the dynamic assignment of nodes to controllers to achieve load balancing. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Resource allocation techniques for downlink Non-Orthogonal Multiple Access-Based 5G wireless systems

    Resource allocation techniques for downlink Non-Orthogonal Multiple Access-Based 5G wireless systems by Ali, Zuhura Juma

    Published 2021
    “…The results show that the femtocell user’s minimum energy efficiency by applying NOMA with power allocation method using Sequential Convex Programming and user pairing based on Greedy Algorithm (NOMA-SCP-GA) is higher by 38.22 %, 58.84 %, and 76.39 % compared to NOMA-DC, NOMA-FTPA, and OFDMA methods respectively. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Fair energy-efficient resource allocation for downlink NOMA heterogeneous networks

    Fair energy-efficient resource allocation for downlink NOMA heterogeneous networks by Ali, Zuhura Juma, Noordin, Nor Kamariah, Sali, Aduwati, Hashim, Fazirulhisyam

    Published 2020
    “…The energy consumption of both the transmitter and the receiver are considered to simulate the real system design. The Greedy Algorithm (GA) is used to achieve a low-complex optimal solution during the user-pairing process. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: