Search Results - (( java simulation optimization algorithm ) OR ( testing interaction based algorithm ))

Refine Results
  1. 1
  2. 2

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4
  5. 5

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  6. 6

    Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm by Mohammed Abdullah, Abdullah Nasser

    Published 2018
    “…Interaction, or t-way, testing, where t indicates the interaction strength, is an approach to generate test suite for detecting fault due to interaction. …”
    Get full text
    Get full text
    Thesis
  7. 7

    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

    Published 2015
    “…Here, a set of sampled test cases is generated based on t-way covering problem (where t indicates the interaction strength). …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  9. 9

    CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm by Ng, Yeong Khang

    Published 2019
    “…Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  10. 10

    T-way testing : a test case generator based on melody search algorithm by Toh, Shu Yuen

    Published 2015
    “…This thesis is research on developing a T-Way Testing : A Test Case Generator Based On Melody Search Algorithm (TTT-MS) to generate optimum final test list. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  11. 11

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  12. 12

    A hybrid kidney algorithm strategy for combinatorial interaction testing problem by Ameen Ali, Mohammed Ba Homaid

    Published 2022
    “…Combinatorial Interaction Testing (CIT) generates a sampled test case set (Final Test Suite (FTS)) instead of all possible test cases. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

    Whale optimization algorithm strategies for higher interaction strength t-way testing by Ali Abdullah, Hassan, Salwani, Abdullah, Kamal Z., Zamli, Rozilawati, Razali

    Published 2022
    “…Numerous existing metaheuristic-based solutions aim to assist the test suite generation for combinatorial testing, also known as t-way testing (where t indicates the interaction strength), viewed as an optimization problem. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  16. 16

    CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm by Alsewari, Abdulrahman A., Ng, Yeong Khang, Kamal Z., Zamli, Mohammed E., Younis

    Published 2019
    “…In this paper, a Jaya algorithm is proposed as an optimization algorithm engine to construct a test list based on IOR in the proposed combinatorial test list generator strategy and named as (CTJ). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17
  18. 18

    Adopting A Particle Swarm-Based Test Generator Strategy For Variable-Strength And T-Way Testing by S. Ahmed, Bestoun

    Published 2011
    “…Recently, researchers have started to explore the use of Artificial Intelligence (AI)-based algorithms as t-way (where t indicates the interaction strength) and variable-strength testing strategies. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  20. 20

    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
    “…Given the impracticality of testing every possible interaction due to time, budget, and resource constraints, combinatorial testing, which is t-way testing, is adopted to cover parameter interactions efficiently. …”
    Get full text
    Get full text
    Get full text
    Article