检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (2): 176-178.doi: 10.3969/j.issn.1000-3428.2010.02.062

• 人工智能及识别技术 • 上一篇    下一篇

基于模式竞争度的完全欺骗问题分析

汪 彤，李云强   

  1. (解放军信息工程大学电子技术学院，郑州 450004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-01-20 发布日期:2010-01-20

Analysis of Complete Deceptive Problem Based on Schema Competitive Degree

WANG Tong, LI Yun-qiang   

  1. (Electronic Technique Institute, PLA Information Engineering University, Zhengzhou 450004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-01-20 Published:2010-01-20

PDF

823

摘要： 对一类完全欺骗问题求解过程中模式的竞争状况进行分析，给出欺骗吸引子的竞争度公式，说明欺骗吸引子的任意阶关联模式相对它的主竞争模式都具有竞争优势。针对完全欺骗性比率在度量完全欺骗问题模式欺骗程度时存在的弊端，利用模式竞争度，给出一阶主欺骗度的度量方法，通过典型的完全欺骗函数验证了该度量方式的合理性。并根据完全欺骗问题模式欺骗程度的不同，定义了强完全欺骗问题。

关键词: 竞争度, 完全欺骗问题, 一阶主欺骗度, 强完全欺骗问题

Abstract: This paper analyses the schema competitive condition of a class of complete deceptive functions, gives a formula of deceptive attractor, shows the deceptive attractor’s related random order schema to its main competitive schema has competitive superiority. To complete deceptive proportion’s defect, it gives a measuring method, one order main deceptive degree by using schema competitive degree, and proves its rationality by using representative complete deceptive functions. Based on the peculiarity of schema competitive condition of complete deceptive functions, hard complete deceptive functions are defined.

Key words: competitive degree, complete deceptive problem, one order main deceptive degree, hard complete deceptive problem

中图分类号: