1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.SE2019★ 1 cited
Using simulated annealing for locating array construction
Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa +1
Context: Combinatorial interaction testing is known to be an efficient testing strategy for computing and information systems. Locating arrays are mathematical objects that are use…
cs.SE2019★ 1 cited
Finding minimum locating arrays using a CSP solver
Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa +1
Combinatorial interaction testing is an efficient software testing strategy. If all interactions among test parameters or factors needed to be covered, the size of a required test…