• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Information Science and Control Engineering >A Test Suite Reduction Method Based on Novel Quantum Ant Colony Algorithm
【24h】

A Test Suite Reduction Method Based on Novel Quantum Ant Colony Algorithm

机译：一种基于新型量子蚁群算法的测试套件约简方法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Test Suite Reduction is to find a subset of the original test suite which contains less test cases than original one but covers the same test request. In order to reduce the size of the data processed by Ant Colony Algorithm, this paper firstly chooses the test case set to form a candidate set. Then, based on the ant colony algorithm, QEA (Quantum-inspired Evolutionary Algorithm) and quantum revolving gate are introduced. The advantages of entanglement and coherence of quantum computation are introduced. In addition, we propose a Test Suite Reduction method based on Modified Quantum Ant Colony Algorithm. Finally we make quantity of simulation experiments compared the result of other algorithms, we find that the modified quantum ant colony system can solve the problem more efficiently and perform much better.
机译：减少测试套件是为了找到原始测试套件的一个子集，该子集包含的测试用例少于原始测试用例，但涵盖了相同的测试请求。为了减少蚁群算法处理的数据量，本文首先选择测试用例集形成候选集。然后，基于蚁群算法，引入了量子启发进化算法（QEA）和量子旋转门。介绍了量子计算的纠缠和相干的优点。此外，我们提出了一种基于改进的量子蚁群算法的测试套件简化方法。最后，通过与其他算法的结果比较，进行了大量的仿真实验，发现改进的量子蚁群系统可以更有效地解决该问题，并且性能更好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号