Search Results - (( based interactive using algorithm ) OR ( using optimization _ algorithm ))

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

“…Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. …”
Get full text
Get full text
Get full text

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

“…To ensure that WOA conquers premature convergence and avoids local optima for large search spaces (owing to high-order interaction), three variants of WOA have been developed, namely Structurally Modified Whale Optimization Algorithm (SWOA), Tolerance Whale Optimization Algorithm (TWOA), and Tolerance Structurally Modified Whale Optimization Algorithm (TSWOA). …”
Get full text
Get full text
Get full text

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

Get full text
Get full text
Get full text

VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

“…The aim of the proposed approach is to study the benefit of using visualization techniques to explorer Genetic Algorithm data based on gene values. …”
Get full text
Get full text

Sequence t-way test generation using the barnacles mating optimizer algorithm by Kamal Z., Zamli, Kader, Md. Abdul

“…More precisely, we focus on the generation of test cases due to the ordering of inputs (or sequence) using the newly developed Barnacles Mating Optimizer (BMO) Algorithm. …”
Get full text
Get full text
Get full text
Get full text

Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

“…In this study, five different types of superpixels ranging from watershed, density, graph, clustering and energy optimization categories are evaluated. The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text

An experimental study of modified black hole algorithms by Mohammed, Suad Khairi

“…Ultimately, seven variants of BH algorithms are established based on the white hole, local search, and gravitational interaction. …”
Get full text
Get full text
Get full text

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

“…This study proposes a combinatorial testing method utilizing the Whale Optimization Algorithm (WOA). The study compares the performance of WOA with various existing strategies, such as Greedy, Density, TVG, Union, ParaOrder, ReqOrder, ITTDG, AURA, Java Algorithm (CTJ), TTSGA, and AFA. …”
Get full text
Get full text
Get full text

Dynamic social behavior algorithm for real-parameter optimization problems and optimization of hyper beamforming of linear antenna arrays by Prajindra�Sankar K., Kiong T.S., Siaw�Paw J.K.

Effects of Different Superpixel Algorithms on Interactive Segmentations by Goh, Kok Luong, Ng, Giap Weng, Muzaffar Hamzah, Chai, Soo See

“…In this study, five different types of superpixels ranging from watershed, density, graph, clustering and energy optimization categories are evaluated. The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

“…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
Get full text
Get full text

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

“…If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. Addressing these aforementioned issues and complementing the existing sequence based strategies such as t-SEQ, Sequence Covering Array Generator and Bee Algorithm, this thesis presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA). …”
Get full text
Get full text

TBat: A Novel Strategy for Minimization of T-Way Interaction Test Suite Based on the Particle Swarm Optimization and the Bat Algorithm by Kamal Z., Zamli, Alsariera, Yazan A.

“…This project develops a novel strategy to minimize the test consideration using the Particle Swarm Optimization and the Bat Algorithm.…”
Get full text
Get full text

Application of conjugate gradient approach for nonlinear optimal control problem with model-reality differences by Leong, Wah June, Sie, Long Kek, Teo, Kok Lay, Sim, Sy Yi

“…Specifically, the modified model-based optimal control problem is resulted. Here, the conjugate gradient approach is used to solve the modified model-based optimal control problem, where the optimal solution of the model used is calculated repeatedly, in turn, to update the adjusted parameters on each iteration step. …”
Get full text
Get full text
Get full text

Application of conjugate gradient approach for nonlinear optimal control problem with model-reality difference by Sie, Long Kek, Wah, June Leong, Sy, Yi Sim, Kok, Lay Teo

“…Specifically, the modified model-based optimal control problem is resulted. Here, the conjugate gradient approach is used to solve the modified model-based optimal control problem, where the optimal solution of the model used is calculated repeatedly, in turn, to update the adjusted parameters on each iteration step. …”
Get full text
Get full text
Get full text

African Buffalo Optimization Algorithm Based T-Way Test Suite Generation Strategy for Electronic-Payment Transactions by Odili, Julius Beneoluchi, Noraziah, Ahmad, Nasser, Abdullah B., Abd. Wahab, Mohd Helmy, Ahmed, Mashuk

Get full text
Get full text
Get full text
Get full text
Get full text

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.

“…This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. …”
Get full text
Get full text
Get full text

Pairwise Test Suite Generation Using Adaptive Teaching Learning-Based Optimization Algorithm with Remedial Operator by Fakhrud, Din, Kamal Z., Zamli

“…Being a NP-complete problem, pairwise test suite generation problem has been addressed using several meta-heuristic algorithms including the Fuzzy Adaptive Teaching Learning-based Optimization (ATLBO) algorithm in the literature. …”
Get full text
Get full text
Get full text

Harmony search-based robust optimal controller with prior defined structure by Rafieishahemabadi, Ali

“…In this approach, a combination of interacting two levels HS optimization algorithm is presented. …”
Get full text
Get full text

Sizes of Superpixels and their Effect on Interactive Segmentation by Goh, Kok Luong, Ng, Giap Weng, Muzaffar, Hamzah, Chai, Soo See

“…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
Get full text
Get full text
Get full text