Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A novel chaotic manta-ray foraging optimization algorithm for thermo-economic design optimization of an air-fin cooler
OE Turgut - SN Applied Sciences, 2021 - Springer
This research study aims to introduce chaos theory into the Manta Ray Foraging
Optimization (MRFO) Algorithm and optimize a real-world design problem through the chaos …
Optimization (MRFO) Algorithm and optimize a real-world design problem through the chaos …
Solving the t-Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling
To meet the increasing demand for customized software, highly configurable systems
become essential in practice. Such systems offer many options to configure, and ensuring …
become essential in practice. Such systems offer many options to configure, and ensuring …
State of the CArt: evaluating covering array generators at scale
Providing a reusable methodology for the evaluation of covering array generation utilities
and apply it to a corpus of such tools, obtaining an overview of supported features and …
and apply it to a corpus of such tools, obtaining an overview of supported features and …
AutoCCAG: An automated approach to constrained covering array generation
Combinatorial interaction testing (CIT) is an important technique for testing highly
configurable software systems with demonstrated effectiveness in practice. The goal of CIT …
configurable software systems with demonstrated effectiveness in practice. The goal of CIT …
An adaptive penalty based parallel tabu search for constrained covering array generation
Context: The generation of the optimal constrained covering arrays is a key challenge in the
research field of combinatorial testing, where a variety of Constrained Covering Array …
research field of combinatorial testing, where a variety of Constrained Covering Array …
[HTML][HTML] A population-based local search algorithm for the identifying code problem
A Lara-Caballero, D González-Moreno - Mathematics, 2023 - mdpi.com
The identifying code problem for a given graph involves finding a minimum subset of
vertices such that each vertex of the graph is uniquely specified by its nonempty …
vertices such that each vertex of the graph is uniquely specified by its nonempty …
A synergic quantum particle swarm optimisation for constrained combinatorial test generation
X Guo, X Song, J Zhou - IET software, 2022 - Wiley Online Library
Combinatorial testing (CT) can efficiently detect failures caused by interactions of
parameters of software under test. The CT study has undergone a transition from traditional …
parameters of software under test. The CT study has undergone a transition from traditional …
Implementation of Hybrid Particle Swarm Optimization for Optimized Regression Testing.
V Prakash, S Gopalakrishnan - Intelligent Automation & Soft …, 2023 - search.ebscohost.com
Software test case optimization improves the efficiency of the software by proper structure
and reduces the fault in the software. The existing research applies various optimization …
and reduces the fault in the software. The existing research applies various optimization …
A tolerance-based memetic algorithm for constrained covering array generation
X Guo, X Song, J Zhou, F Wang - Memetic Computing, 2023 - Springer
The research focus in the field of combinatorial testing has shifted from unconstrained
covering array generation (CAG) to constrained covering array generation (CCAG). Most …
covering array generation (CAG) to constrained covering array generation (CCAG). Most …
A Benchmark Generator for Combinatorial Testing
C Ansotegui, E Torres - arxiv preprint arxiv:2301.08134, 2022 - arxiv.org
Combinatorial Testing (CT) tools are essential to test properly a wide range of systems (train
systems, Graphical User Interfaces (GUIs), autonomous driving systems, etc). While there is …
systems, Graphical User Interfaces (GUIs), autonomous driving systems, etc). While there is …