constraint satisfaction problem

基本解釋

• [計(jì)算機(jī)科學(xué)技術(shù)]約束滿(mǎn)足
• [電子、通信與自動(dòng)控制技術(shù)]約束性可滿(mǎn)足問(wèn)題

英漢例句

雙語(yǔ)例句

• Constraint propagation is a method for solving constraint satisfaction problem (CSP).
  約束傳播算法是求解約束滿(mǎn)足問(wèn)題的一種重要方法。
• Product design is considered as constraint satisfaction problem (CSP), and an approach is proposed which is methodology based-on constraint network.
  將產(chǎn)品設(shè)計(jì)看作為約束滿(mǎn)足問(wèn)題，提出基于約束網(wǎng)絡(luò)的產(chǎn)品設(shè)計(jì)方法。
• 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.
  將熱軋批量計(jì)劃問(wèn)題作為一個(gè)約束滿(mǎn)足問(wèn)題處理，建立不確定計(jì)劃數(shù)的VRPSTW約束滿(mǎn)足模型。

• constraint satisfaction problem更多例句

詞組短語(yǔ)

短語(yǔ)

• constraint satisfaction problem csp 約束滿(mǎn)足問(wèn)題
• Distributed Constraint Satisfaction Problem 分布式約束滿(mǎn)足問(wèn)題
• Constraint Satisfaction optimization problem 優(yōu)化問(wèn)題;約束滿(mǎn)足優(yōu)化問(wèn)題
• Soft constraint satisfaction problem 軟約束的滿(mǎn)足問(wèn)題
• valued constraint satisfaction problem 加權(quán)約束滿(mǎn)足問(wèn)題

• constraint satisfaction problem更多詞組

專(zhuān)業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 約束滿(mǎn)足

  This paper presents two parallel algorithms for network consistency of the constraint satisfaction problem.
  本文給出了約束滿(mǎn)足問(wèn)題網(wǎng)絡(luò)弧相容的兩個(gè)并行算法PAC-1和PAC-2。

  電子、通信與自動(dòng)控制技術(shù)

• 約束性可滿(mǎn)足問(wèn)題