Let Z_n be the set of residue classes modulo n and let r, s,…be its elements.If the set S={(R_i, S_i)|i=1, 2,…, m}Z_nxZ_n(0【m≤n) satisfies the conditions that R_i≠R_j, S_i≠S_j, S_i+R_i≠S_j+R_j and S_i-R_i≠S_j-...Let Z_n be the set of residue classes modulo n and let r, s,…be its elements.If the set S={(R_i, S_i)|i=1, 2,…, m}Z_nxZ_n(0【m≤n) satisfies the conditions that R_i≠R_j, S_i≠S_j, S_i+R_i≠S_j+R_j and S_i-R_i≠S_j-R_j when i≠j, then we say that S is a partial n-solution with m elements.展开更多
A generalization of the well-known n-queen problem is to put N×k‘queens’on an k×nchessboard in such a way that each row and each column contains exactly k‘queens’and eachdiagonal with length from 1 to n ...A generalization of the well-known n-queen problem is to put N×k‘queens’on an k×nchessboard in such a way that each row and each column contains exactly k‘queens’and eachdiagonal with length from 1 to n and slope either 1 or -1 contains at most k‘queens’.Aconstruction is given to show that this is always possible whenever n≥4 and n≥k≥1.展开更多
基于角色的协同RBC(Role-Based Collaboration)是一套研究角色及它们之间复杂关系的方法、理论和技术。在RBC中,群组角色分配GRA(Group Role Assignment)既是一个关键问题,也是一个难题。已有许多研究探讨了基于Q(Qualification)矩阵来...基于角色的协同RBC(Role-Based Collaboration)是一套研究角色及它们之间复杂关系的方法、理论和技术。在RBC中,群组角色分配GRA(Group Role Assignment)既是一个关键问题,也是一个难题。已有许多研究探讨了基于Q(Qualification)矩阵来处理GRA问题,但仅利用Q矩阵难以描述问题中的复杂约束关系。因此,将约束集(Constraint)引进E-CARGO模型,提出了带约束的EC-CARGO模型,研究了RBC、GRA、SAT(SATisfaction)和CSP(Constraint Satisfaction Problem)之间的联系,建立了RBC-GRA-SAT-CSP问题求解转换关系;提出应用EC-CARGO模型求解经典CSP约束满足问题的方法,进而描述了应用GRA求解CSP约束满足问题的通用框架。最后以N皇后问题为例,验证了通过GRA的约束指派求解CSP问题的有效性。展开更多
文摘Let Z_n be the set of residue classes modulo n and let r, s,…be its elements.If the set S={(R_i, S_i)|i=1, 2,…, m}Z_nxZ_n(0【m≤n) satisfies the conditions that R_i≠R_j, S_i≠S_j, S_i+R_i≠S_j+R_j and S_i-R_i≠S_j-R_j when i≠j, then we say that S is a partial n-solution with m elements.
文摘A generalization of the well-known n-queen problem is to put N×k‘queens’on an k×nchessboard in such a way that each row and each column contains exactly k‘queens’and eachdiagonal with length from 1 to n and slope either 1 or -1 contains at most k‘queens’.Aconstruction is given to show that this is always possible whenever n≥4 and n≥k≥1.
