New bounds for binary covering arrays using simulated annealing-Reference-Cited by-同舟云学术

New bounds for binary covering arrays using simulated annealing

Published:2012-02 Issue:1 Volume:185 Page:137-152
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Torres-Jimenez Jose,Rodriguez-Tello Eduardo

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference59 articles.

1. A new polynomial-time cooling schedule;Aarts,1985

2. Simulated annealing cooling schedules for the school timetabling problem;Abramson;Asia-Pacific Journal of Operational Research,1999

3. Search based software testing of object-oriented containers;Arcuri;Information Sciences,2008

4. Software Testing Techniques;Beizer,1990

5. The density algorithm for pairwise interaction testing;Bryce;Software Testing Verification and Reliability,2007

Cited by 69 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New Upper Bounds for Covering Arrays of Order Seven;Mathematics;2024-06-20

2. Automated Generation of Covering Array Using Gravitational Search Algorithm and Biogeography Based Optimization;2024-03-11

3. Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions;SN Computer Science;2024-02-01

4. Automated Generation of Covering Array Using Model Checking and Modified Gravitational Search Algorithm;2023-12-06

5. Don’t Go Down the Rabbit Hole: Reprioritizing Enumeration for Property-Based Testing;Proceedings of the 16th ACM SIGPLAN International Haskell Symposium;2023-08-30