Starting with a ground structure, we use binary number combinatorial algorithm to generate a number of topologies, which are a sequence of substructures with different node distributions.
从原始结构着手，通过使用二进制组合算法来产生一系列具有不同节点分布的子结构，即拓扑组。
Taking class arrangement as an example, we have given a new combinatorial algorithm for multi-task planning under given resources and discussed its implementation with LISP programming language.
以学校排课问题为例讨论了在资源有限的条件下确定多任务分配方案的模型，并给出一种基于组合方法的算法和用Lisp语言数据结构的实现方法。
Taking class arrangement as an example, we have given a new combinatorial algorithm for multi-task planning under given resources and discussed its implementation with LISP programming language.
以学校排课问题为例讨论了在资源有限的条件下确定多任务分配方案的模型，并给出一种基于组合方法的算法和用Lisp语言数据结构的实现方法。
应用推荐