ai怎么約束每個字的大小

Constraint Satisfactory problems, as the name suggests are the problems which have some constraints which need to be satisfied while solving any problem. In simpler words, we can say that while solving any problem or changing any state to reach to the goal state, our Agent cannot violate the constraints which are defined for any problem in prior.

約束令人滿意的問題 ，顧名思義就是在解決任何問題時需要滿足一些約束的問題。 用簡單的話來說，我們可以說，在解決任何問題或更改任何狀態(tài)以達(dá)到目標(biāo)狀態(tài)時，我們的Agent不會違反先前為任何問題定義的約束。

In solving the constraint satisfactory problems, an Agent has the following parameters to consider: a set of variables, Domain, Set of constraints.

在解決約束令人滿意的問題時 ，Agent要考慮以下參數(shù)： 一組變量 ， 域 ， 約束集 。

Set of variables:

變量集：

The variables are like empty containers in an agent (system) where the data is to be placed. Any information or data that the agent deals with has to be stored somewhere and this work is done by the variables. The collection of all the variables that the agent uses to solve that particular problem is known as the set of variables for that problem.

變量就像要放置數(shù)據(jù)的代理(系統(tǒng))中的空容器一樣??。 代理處理的任何信息或數(shù)據(jù)都必須存儲在某個位置，并且此工作由變量完成。 代理用來解決特定問題的所有變量的集合稱為該問題的變量集。

Domain:

域：

Domain is the field in which knowledge is to be attained by the agent. Any problem deals with the information or data in any particular field and the domain defines this field. A domain can simply be defined as what data or information is to be collected or placed.

領(lǐng)域是代理商要獲取知識的領(lǐng)域。 任何問題都與任何特定字段中的信息或數(shù)據(jù)有關(guān)，并且域定義了此字段。 域可以簡單地定義為要收集或放置的數(shù)據(jù)或信息。

Set of constraints:

約束集：

It is the collection of all the restrictions and regulations that are imposed on the agent while solving the problem. The Agent cannot violate or avoid these restrictions while performing any action.

它是解決問題時對代理施加的所有限制和法規(guī)的集合。 代理在執(zhí)行任何操作時不能違反或避免這些限制。

Any agent (Artificial Intelligence-based) who solves the constraint Satisfactory problems has the above-mentioned parameters embedded in its system.

解決約束令人滿意的問題的任何代理(基于人工智能)都將上述參數(shù)嵌入其系統(tǒng)中。

There are many games and puzzles which lie under the constraint satisfactory problem. Some commonly known among them are Sudoku, N-queens problem, Map Coloring Problem, Crossword, Crypt-Arithmetic Problem, Latin Square Problem, etc. All these problems have their own set of rules and regulations that should not be violated and these rules and regulations act as constraints for each of them.

在令人滿意的約束下有許多游戲和難題。 其中常見的是Sudoku，N-queens問題，Map著色問題，填字游戲，Crypt-算術(shù)問題，Latin Square問題等。所有這些問題都有自己的一套規(guī)則和規(guī)定，不應(yīng)被違反，這些規(guī)則和法規(guī)對每個法規(guī)都有約束。

翻譯自: https://www.includehelp.com/ml-ai/constraint-satisfactory-problem-in-artificial-intelligence.aspx

ai怎么約束每個字的大小

總結(jié)

以上是生活随笔為你收集整理的ai怎么约束每个字的大小_人工智能的约束满意问题的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。