go top

网络释义专业释义

  [计] constraint satisfaction

约束满足 ( Constraint Satisfaction )作为求解大规模组合优化问题的方法之一,能对搜索空间进行修剪,从而大大减少搜索的次数和时间。

基于198个网页-相关网页

  satisfied to restrain

...约束满足 [gap=981]e structure; test paper auto-production ;database management of test questions ; satisfied to restrain; ...

基于112个网页-相关网页

短语

约束满足问题 Constraint Satisfaction Problem ; Constraint Satisfaction Problem-CSP ; CSP ; constraint satisfy problem

约束满足搜索 constraint satisfaction search

分布式约束满足问题 DCSP ; Distributed Constraint Satisfaction Problem ; DISCSP

弹性约束满足问题 ECSP

约束满足网络 constraint satisfaction network

分布式约束满足 distributed constraint satisfaction

动态约束满足问题 Dynamic Constraint Satisfaction Problem

量词约束满足 QCSP

部分约束满足问题 PCSP

 更多收起网络短语
  • constraint satisfaction - 引用次数:121

    Constraint satisfaction model is one of the successful models. There are some aspects to improve.

    约束满足模型是较为成功的模型之一,但也存在可改进之处。

    参考来源 - 一个改进的约束满足模型
    constrain satisfy problem - 引用次数:1

    参考来源 - 基于超低频电磁波的管道机器人示踪定位技术研究
  • constraint satisfaction - 引用次数:3

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

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

    参考来源 - 基于事例推理的车身内部布置系统研究开发
  • constraint satisfaction

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

双语例句原声例句

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

    In general, constraint satisfaction problems are NP-Complete.

    youdao

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

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

    youdao

  • 论文提出采用约束满足方式作为解决企业集成过程冲突消解方式

    The paper proposes that constraints satisfaction method can be used as a conflict resolution approach in the process of enterprise integration.

    youdao

更多双语例句
  • And now we want to find the subset of a that has the maximum value, subject to the weight constraint.

    会有一个值与其对应,现在我们想要找出满足,重量约束条件的a的最大值子集。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • So he's packing and unpacking, packing and unpacking, trying all possible combinations of objects that will obey the constraint. And then choosing the winner. Well, this is like an algorithm we've seen before. It's not greedy.

    因此它不断装包和清包,尝试了所有满足约束条件的物品组合,最后选择最优者,这很像我们以前看过的一个算法,这不是贪婪算法。

    麻省理工公开课 - 计算机科学及编程导论课程节选

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定