In general, constraint satisfaction problems are NP-Complete.
一般而言，约束满足问题是NP完全的。
Based on constraint satisfaction problems model a global scheduling module structure is designed.
采用约束满足问题模型建立全局调度系统模型，设计了全局调度模块结构。
Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints.
约束可满足性问题是一大类常出现于现实应用中的复杂问题，因其繁多的约束条件而出名。
Some of this software can be extended for city planning, public transportation vehicles and other arrangements path constraint satisfaction problems.
将本软件稍作扩展即可用于城市规划、公交车路径安排等多种约束满足问题。
Some of this software can be extended for city planning, public transportation vehicles and other arrangements path constraint satisfaction problems.
将本软件稍作扩展即可用于城市规划、公交车路径安排等多种约束满足问题。
应用推荐