期刊文献+

求解测试集优化问题 被引量:2

Solving Test Set Optimization Problem
下载PDF
导出
摘要 数字电路的测试生成通常是求解一个或一组测试矢量,这些测试矢量能够激活原始故障,并将这些故障效应传递到最终的输出端。测试集优化的基本目标是确定有效的测试矢量,即通过这些测试向量可以区分电路的正常状态与故障状态。目前随着各种智能优化算法的深入研究发展,针对测试集的优化方案也成为了这些智能策略发挥的舞台。 the solution to digital circuits test generation is usually one or a set of test vectors, these test vectors can activate the original failure and the effect of these failures is passed to the final output. Basic target is to identify effective test set optimization of test vectors, the adoption of these test vectors can distinguish between the normal state of the circuit and fault status. Now with a variety of in-depth research and development of intelligent optimization algorithm, for the test set optimization programme has become the smart strategy play to the stage.
作者 付欣 付帅
出处 《科技通报》 北大核心 2012年第6期96-97,100,共3页 Bulletin of Science and Technology
关键词 测试集优化 测试矢量 冗余结构 test set optimization test vector redundant structure
  • 相关文献

参考文献7

  • 1朱虎,宋恩民,路志宏.求解图着色问题的最大最小蚁群搜索算法[J].计算机仿真,2010,27(3):190-192. 被引量:11
  • 2廖飞雄,马良.图着色问题的启发式搜索蚂蚁算法[J].计算机工程,2007,33(16):191-192. 被引量:16
  • 3Jinno C, Inoue M, Fujiwara H. Internally balanced structrue with hold and switching functions[J]. Transactions of the In- stitute of Electronics, Information and Communication En- gineers D-I. 2003, J86D-I(9):682-690.
  • 4Fujiwara H. The complexity of fault detection problems fot combinational logic circuits[J]. Transactions of the Informa-] /tion Processing Society of Japan. 1986, 27(8):768-773.
  • 5Hamzaoglu I, Patel J H. Test set compaction algorithms for combinational circuits [J]. IEEE Transactions on Comput- er-Aided Design of Integrated Circuits and Systems. 2000, 19(8):957-963.
  • 6Lu Changhua, Zhang Qibo, Jiang Weiwei. A global opti- mization algorithm for the minimum test set of circuits [C]. IEEE International Conference on Robotics, Intelligent Sys- tems and Signal Proceeding, Changsha, Hunan, China, 2003, 2:1203-1207.
  • 7Sanchez E, Reorda M S, Squillero G. Efficient techniques for automatic verification-oriented test set optimization [J]. International Journal of Parallel Programming. 2006, 34(1): 93-109.

二级参考文献14

  • 1范辉,华臻,李晋江,原达.点覆盖问题的蚂蚁算法求解[J].计算机工程与应用,2004,40(23):71-73. 被引量:4
  • 2陈卫东.求图着色问题的新算法[J].微计算机应用,2004,25(4):391-395. 被引量:11
  • 3刘景发,王增波,黄文奇.用均场退火算法解四色问题[J].计算机工程与应用,2005,41(3):67-69. 被引量:1
  • 4王秀宏,赵胜敏.利用蚂蚁算法求解图的着色问题[J].内蒙古农业大学学报(自然科学版),2005,26(3):79-82. 被引量:7
  • 5M Dorigo, C A Maniezzov. The ant system: optimization by a colony of cooperating agents [ J ]. IEEE Trans. on System, Man and Cybernetics, 1996,26( 1 ) :1 - 13.
  • 6Dorigom, L M Gambardella. Ant colony system: a cooperative learning approach to the traveling salesman problem [ J ]. IEEE Trans. on Evolutionary Computation, 1997, 1 ( 1 ) :53 -66.
  • 7T N Bui, T H Nguyen, C M Patel, ET AL. An ant - based algorithm for coloring graphs [ J ]. Discrete Applied Mathematics. 2008,156(2) : 190 -200.
  • 8T Stutzle, H Hoos. Improvements on the Ant System: Introducing MAX - MIN Ant System [ C ]. Proceedings of the Intemational Conference on Artificial Nerual Networks and Genetic Algorithms, 1997. 245 - 249.
  • 9B Malika, L Rafik. Ant Colony System for Graph Coloring Problem[ C ]. Proceedings of the 2005 International Conference on Computational Intelligence for Modelling, Control and Automation, and International Conference Intelligent Agents, Web Technologies and Internet Commerce, 2005,11 ( 1 ) :786 - 791.
  • 10廖飞雄,马良.图着色问题的启发式搜索蚂蚁算法[J].计算机工程,2007,33(16):191-192. 被引量:16

共引文献22

同被引文献14

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部