The set partition problem is a typical NP-Complete problem. An optimization model of set partition problem is given in this paper. An ant colony algorithm is put forward to solve this problem.
集合划分问题是一个典型的NP完全问题，建立了集合划分问题的优化数学模型，采用蚁群算法解决了此问题。
On this bases, similar matrix and similar interval are proposed in combination with rough set theory. They are useful in knowledge partition problem in incomplete information system.
在此基础上结合粗糙集理论提出了相似矩阵、相似区间的概念，并将其应用于不完备信息系统知识分类的问题中。
On this bases, similar matrix and similar interval are proposed in combination with rough set theory. They are useful in knowledge partition problem in incomplete information system.
在此基础上结合粗糙集理论提出了相似矩阵、相似区间的概念，并将其应用于不完备信息系统知识分类的问题中。
应用推荐