Back to search

Article

Beautiful Mind: a meta-heuristic algorithm for generating minimal covering array

2024-02-14

Abstract excerpt

<title>Abstract</title> <p>Today, the application of meta-heuristic algorithms in solving problems is very important. This importance has led to the development of hundreds of types of meta-heuristic algorithms by researchers. The reason for the high number of such algorithms is that an algorithm may be superior to its competitors in a particular problem. Generating a test set in Combinatorial Testing (CT) is one...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work
b5ed348f-96e6-503a-87bc-0a561b691abc
DOI
10.21203/rs.3.rs-3195308/v2
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
Beautiful Mind: a meta-heuristic algorithm for generating minimal covering arrayDOI 10.21203/rs.3.rs-3195308/v2
Select a neighboring publication to make it the new centre.