go top

## constraint satisfaction 美 [kənˈstreɪnt ˌsætɪsˈfækʃn]

• 受限制满足；约束补偿

### 网络释义专业释义英英释义

[计] 约束满足

限制满足

约束补偿

受限制满足

Constraint Satisfaction Problem 约束满足问题 ; 限制满足问题 ; 束满足问题 ; 满足问题

Constraint Satisfaction Problems 约束满足问题 ; 约束满意问题

Geometric Constraint Satisfaction Problem 束满足问题 ; 几何约束满足问题

更多收起网络短语
• 约束可满足 - 引用次数：2

SAT problem is the set of satisfiable boolean formulas,which can be widely used in such fields as symbolic logic,artificial intelligence,constraint satisfaction problem,design and detection of VLSI integrate circuit,theories of computer science,computer vision,proof of machine theory,robot program,and machine learning.

SAT问题是指可满足布尔表达式的集合，它在数理逻辑、人工智能、约束可满足性问题、VLSI集成电路设计与检测、计算机科学理论、计算机视觉、机器定理证明、机器人规划、机器学习等领域具有广阔的应用背景。

参考来源 - 线性公式可满足性判定问题的复杂性
限制求解 - 引用次数：1

参考来源 - 限制的对象表示和计算 in C
约束满足
• 约束满足 - 引用次数：3

The replacement parameters, reasoning rules, constraint satisfaction solving and checking parameters were included in the process of whole modification.

事例修改过程包括参数替换、规则推理基于约束满足求解和参数检查这些步骤。

参考来源 - 基于事例推理的车身内部布置系统研究开发
• 限制满足 - 引用次数：1

参考来源 - 思维是如何把握世界的
• 约束满足

·2,447,543篇论文数据，部分数据来源于NoteExpress

#### Constraint satisfaction

• abstract: In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a set of values for the variables that satisfies all constraints—that is, a point in the feasible region.

### 双语例句

• In general, constraint satisfaction problems are NP-Complete.

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

• 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.

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

\$firstVoiceSent
- 来自原声例句