登录 注册 会员服务 联系我们

A survey on the state of the art of complexity problems for covering arrays

  • Published:2019-12 Issue: Volume:800 Page:107-124
  • ISSN:0304-3975
  • Container-title:Theoretical Computer Science
  • language:en
  • Short-container-title:Theoretical Computer Science

Author:

Kampel Ludwig,Simos Dimitris E.

Funder

Austrian Research Promotion Agency

Vienna Business Agency

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference42 articles.

1. Computational Complexity: A Modern Approach;Arora,2009

2. Supercomputing and grid computing on the verification of covering arrays;Avila-George;J. Supercomput.,2012

3. Biased covering arrays for progressive ranking and composition of web services;Bryce;Int. J. Simul Process Model.,2007

4. Test prioritization for pairwise interaction coverage;Bryce,2005

5. A density-based greedy algorithm for higher strength covering arrays;Bryce;Softw. Test. Verif. Reliab.,2009

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

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

2. An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing;IEEE Transactions on Software Engineering;2023-10-01

3. An investigation of distributed computing for combinatorial testing;Software Testing, Verification and Reliability;2023-02-27

4. IPO-MAXSAT: The In-Parameter-Order Strategy combined with MaxSAT solving for Covering Array Generation;2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09

5. A combined principal component analysis and clustering approach for exploring enormous renovation design spaces;Journal of Building Engineering;2022-05
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3