Constraint propagation is a method for solving constraint satisfaction problem (CSP).
约束传播算法是求解约束满足问题的一种重要方法。
Geometric constraint satisfaction is one of the kernel algorithms in feature based design system.
几何约束求解是基于特征设计系统的核心算法之一。
In general, constraint satisfaction problems are NP-Complete.
一般而言，约束满足问题是NP完全的。
Modeling the scheduling problem of multi-satellites based on the constraint satisfaction;
侦察卫星探测资源调度是一类基于约束满足的优化问题。
The basic constraints for the scheduling problem of agile satellites were analyzed, and then a constraint satisfaction model was established.
本文分析了灵巧卫星调度问题的约束条件，建立了灵巧卫星调度的约束满足模型。
The hot-rolling batch planning problem is treated as a constraint satisfaction problem. A VRPSTW constraint satisfaction model with uncertain rolling plan number is established.
将热轧批量计划问题作为一个约束满足问题处理，建立不确定计划数的VRPSTW约束满足模型。
Based on the state transitions inside the system model and the current system states, the state tracking problem and the optimized constraint satisfaction problem are discussed.
为了寻找系统的当前状态，根据系统模型内部的状态转换，讨论了模型的状态追踪问题和优化约束满足问题。
A constraint satisfaction scheduling model for the initial scheduling problem and a greedy algorithm for it are given based on the constraints analysis and some basic hypothesis.
在调度约束条件分析和一些基本假设的基础上，本文建立了多卫星初始调度约束模型，并给出了模型求解的贪婪算法。
Based on analyzing the merits and faults in the geometric constraint satisfaction algorithm for the present, this article puts forward a new optimal algorithm for 2d full constraint.
从工程实际出发，分析了现有的几何约束求解方法中存在的问题，提出了一种新的二维全约束优化算法。
Constraint modification is the important part of imaging scheduling of earth observing satellite, it solves the problem of constraint satisfaction and optimization of the imaging scheduling.
约束修正是卫星成像调度的重要组成部分，负责处理成像调度方案的约束满足与优化的问题。
Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints.
约束可满足性问题是一大类常出现于现实应用中的复杂问题，因其繁多的约束条件而出名。
Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints.
约束可满足性问题是一大类常出现于现实应用中的复杂问题，因其繁多的约束条件而出名。
应用推荐