Search Results - (( developing using greedy algorithm ) OR ( java application stemming algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    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:
  3. 3
    Current trends strategies in the test redundancy reduction

    Current trends strategies in the test redundancy reduction by Norasyikin, Safieny, Kamal Z., Zamli, Hasneeza, L. Zakaria

    Published 2016
    “…Many strategies in a greedy approach have been developed (including GE, GRE, and HGS), Formal Concept Analysis and non-greedy approach (tReductLAHC, tReductSA) using Metaheuristic Algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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:
  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
    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
    “…Thus, this research proposes a greedy heuristics multiple criteria model which includes operational costs for solving multi-LSSP and develops PPA for improving WCVRP solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    A variable combinatorial test suite strategy based on modified greedy algorithm

    A variable combinatorial test suite strategy based on modified greedy algorithm by Homaid, Ameen A. Ba, Alsewari, Abdulrahman A.

    Published 2015
    “…This proposed will suggest a new CIT strategy based on a modified greedy algorithm (MGA) with addressing the supporting of variable strength interaction to generate a satisfactory test suite size.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Multi-base number representation in application to scalar multiplication and pairing computation

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…In this work, an extension of Greedy algorithm called xGreedy, is proposed. It finds the best approximated powers of each base to be used to convert large integers to new addition chains. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks

    Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks by Moudi, Mehrnaz

    Published 2012
    “…The GreedyZero algorithm has been presented in the Low Stage Interconnection Network. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    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:
  13. 13
    A Grid-Based Reliable Routing (GBRR) protocol for wireless sensor networks

    A Grid-Based Reliable Routing (GBRR) protocol for wireless sensor networks by Jiang, Cailing

    Published 2019
    “…In this research, collaborated with clustering and grid-based routing features, the proposed protocol uses a combination of clustering protocols and geographical protocols with greedy algorithm to accomplish the scalability and adaptability of the randomly deployed sensor networks in a dense and large-scale network. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Information Theoretic-based Feature Selection for Machine Learning

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

    Published 2018
    “…The second test evaluates IFS in a controlled study using simulated datasets. Moreover, the third test used ten natural domain datasets obtained from UCI Repository, in about fifteen different experiments, using three to four different Machine Learning Algorithms for performance evaluation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Development of heuristic task scheduling algorithm in cloud computing

    Development of heuristic task scheduling algorithm in cloud computing by Diallo, Laouratou, Hassan Abdalla Hashim, Aisha, Olanrewaju, Rashidah Funke

    Published 2016
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  16. 16
    Developing a college room allocation system using heuristic algorithm / Raziha Bidin

    Developing a college room allocation system using heuristic algorithm / Raziha Bidin by Bidin, Raziha

    Published 2010
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    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:
  18. 18
    Influence maximisation towards target users and minimal diffusion of information based on information needs

    Influence maximisation towards target users and minimal diffusion of information based on information needs by Temitope, Olanrewaju Abdus-Samad

    Published 2020
    “…IDTU was developed on greedy approach by using graph sketches to improve the selection of influencers that maximize influence spread to a set of target users. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…Results of the experiments that were conducted using various data sets showed that the proposed algorithm produced better course schedule solution than the Greedy Algorithm, Genetic Algorithm, and other variants of Ant System Algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    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:

Search Tools: