Search Results - (( problem using greedy algorithm ) OR ( java application testing algorithm ))

Search alternatives:

Refine Results
  1. 1
    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
    “…Combinatorial testing offers an alternative to overcome the problem. 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:
  2. 2
    Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms

    Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms by Mohd Ariffin, Mohd Khairol Anuar, Baharudin, B. T. Hang Tuah, Leman, Zulkiflle, Delgoshaei, Aidin

    Published 2015
    “…Such phenomena may increase makespan of a project and also decline resource-usage efficiency. To solve this problem, many methods have been proposed before. In this article, an effective backward-forward search method (BFSM) is proposed using Greedy algorithm that is employed as a part of a hybrid with a two-stage genetic algorithm (BFSM-GA). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation

    Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation by Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A.

    Published 2018
    “…This algorithm is invariably called the modified greedy algorithm (MGA). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    A GreedyZero algorithm to minimise the conflicts in an Optical Multistage Interconnection Network

    A GreedyZero algorithm to minimise the conflicts in an Optical Multistage Interconnection Network by Moudi, Mehrnaz, Othman, Mohamed

    Published 2014
    “…In this paper, we have proposed a new algorithm to minimise the number of conflicts of OMINs using the greedy graph colouring and Zero algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    GreedyZero algorithms for conflict-free scheduling in low stage interconnection network

    GreedyZero algorithms for conflict-free scheduling in low stage interconnection network by Moudi, Mehrnaz, Othman, Mohamed

    Published 2015
    “…To avoid this problem, GreedyZero algorithms has been assigned to the Low Stage Interconnection Networks for improving the network performance by reducing the number of passes. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Maintenance staff scheduling system using heuristic-greedy algorithm / Nurliyana Sabli

    Maintenance staff scheduling system using heuristic-greedy algorithm / Nurliyana Sabli by Sabli, Nurliyana

    Published 2010
    “…The scheduling part will be developed using heuristic – greedy algorithm. The schedule part will start by checking the availability of staff at that day. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Comparison between alpha beta pruning algorithm and greedy algorithm in designing winning strategies in the game of checkers / Christy Jr Tan

    Comparison between alpha beta pruning algorithm and greedy algorithm in designing winning strategies in the game of checkers / Christy Jr Tan by Jr Tan, Christy

    Published 2007
    “…The algorithm is useful in some of the game search available today. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  9. 9
    Find the maximum clique by graph coloring using heuristic greedy

    Find the maximum clique by graph coloring using heuristic greedy by Mustafa, Mamat, Suyudi, ., Sukono, ., Bon, A.T.

    Published 2019
    “…In this paper, Graph coloring used for to find maximum clique in a graph with heuristic greedy…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling

    Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling by Ullah, Wasif, Mohd Fadzil Faisae, Ab Rashid, Muhammad Ammar, Nik Mu’tasim

    Published 2025
    “…However, limited attention has been given to CHFS when considering holistic cost models using efficient algorithms. This paper presents a novel Greedy-Assisted Teaching-Learning-Based Optimization (GTLBO) algorithm for CHFS. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    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:
  12. 12
    Automated bilateral negotiation with incomplete information in the e-marketplace.

    Automated bilateral negotiation with incomplete information in the e-marketplace. by Jazayeriy, Hamid

    Published 2011
    “…The MGT algorithm is useful to explore the properties of the Pareto-optimal offers. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    GSAR: Greedy Stand-Alone Position-Based Routing protocol to avoid hole problem occurance in Mobile Ad Hoc Networks

    GSAR: Greedy Stand-Alone Position-Based Routing protocol to avoid hole problem occurance in Mobile Ad Hoc Networks by Al-Shugran, Mahmoud Ali

    Published 2014
    “…Under various mobility conditions, GSAR avoids hole problem by about 87% and 79% over Greedy Perimeter Stateless Routing and Position-based Opportunistic Routing Protocol respectively. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    A comparative study of greedy algorithms and dynamic programming in road network / Nuralya Sofea Hairulanuar

    A comparative study of greedy algorithms and dynamic programming in road network / Nuralya Sofea Hairulanuar by Hairulanuar, Nuralya Sofea

    Published 2024
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    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
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    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:
  17. 17
    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions

    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions by Nur Azriati, Mat

    Published 2023
    “…Moreover, the WCVRP solutions were improved by using PPA. Both models were tested on a WCVRP benchmark problem and a case-based scenario in Kubang Pasu, Kedah. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    Simulated annealing algorithm for solving chambering student-case assignment problem

    Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

    Published 2015
    “…The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased.This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem.The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    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:

Search Tools: