Based on conditional information quantity, a heuristic algorithm for assignment reduction is presented, and the complexity of this algorithm is analyzed.
给出了分配约简的一种启发式算法：条件信息量约简算法，分析了该算法的时间复杂度。
The general algorithms for maximum distribution reduction, assignment reduction and ordered assignment reduction are examined and their time complexities are analyzed.
给出了最大分布约简、分配约简、分配序约简的一般算法。
Secondly, a knowledge acquisition model for the incomplete information systems for the university personnel system on the basis of the tolerance relation assignment reduction using GA is designed.
其次，设计了一个基于本文提出的基于相容关系的分配约简遗传算法的高校人事不完备信息系统的知识获取模型。
Secondly, a knowledge acquisition model for the incomplete information systems for the university personnel system on the basis of the tolerance relation assignment reduction using GA is designed.
其次，设计了一个基于本文提出的基于相容关系的分配约简遗传算法的高校人事不完备信息系统的知识获取模型。
应用推荐