An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing
Author:
Affiliation:
1. College of Computer Science, Inner Mongolia University, Hohhot, Inner Mongolia, China
2. Department of Electrical and Computer Engineering, Portland State University, Portland, OR, USA
Funder
National Natural Science Foundation of China
Inner Mongolia Science and Technology Project
Natural Science Foundation of Major Research Plan of Inner Mongolia
Natural Science Foundation of Inner Mongolia Autonomous Region
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Subject
Software
Link
http://xplorestaging.ieee.org/ielx7/32/10286436/10224655.pdf?arnumber=10224655
Reference66 articles.
1. Adapting the elitism on greedy algorithm for variable strength combinatorial test cases generation
2. An Improved Quantum-Behaved Particle Swarm Optimization for Endmember Extraction
3. Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
4. Multifractional Brownian motion and quantum-behaved particle swarm optimization for short term power load forecasting: An integrated approach
5. A survey on the state of the art of complexity problems for covering arrays
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3