全部

1·In general, constraint satisfaction problems are NP-Complete.

一般而言，约束满足问题是NP完全的。

2·Constraint propagation is a method for solving constraint satisfaction problem (CSP).

约束传播算法是求解约束满足问题的一种重要方法。

3·Modeling the scheduling problem of multi-satellites based on the constraint satisfaction;

侦察卫星探测资源调度是一类基于约束满足的优化问题。

4·Based on constraint satisfaction problems model a global scheduling module structure is designed.

采用约束满足问题模型建立全局调度系统模型，设计了全局调度模块结构。

5·Geometric constraint satisfaction is one of the kernel algorithms in feature based design system.

几何约束求解是基于特征设计系统的核心算法之一。

6·This paper proposes a method of adaptive neural network based on constraint satisfaction for Job Shop Scheduling Problem.

提出了用于解决作业车间调度问题的离散版粒子群算法。

7·Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints.

约束可满足性问题是一大类常出现于现实应用中的复杂问题，因其繁多的约束条件而出名。

8·The basic constraints for the scheduling problem of agile satellites were analyzed, and then a constraint satisfaction model was established.

本文分析了灵巧卫星调度问题的约束条件，建立了灵巧卫星调度的约束满足模型。

9·Some of this software can be extended for city planning, public transportation vehicles and other arrangements path constraint satisfaction problems.

将本软件稍作扩展即可用于城市规划、公交车路径安排等多种约束满足问题。

10·A constraint satisfaction model is given. A hybrid solving algorithm is designed based on constraint satisfaction and heuristics node exchange algorithm.

给出板坯排序问题的约束满足模型，设计了基于约束满足和启发式混合求解算法。