せいやくじゅうそくもんだい
制約充足問題
1. constraint satisfaction problem (esp. in AI); CSP
2. Constraint satisfaction problemConstraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over variables, which is solved by constraint satisfaction methods.
Read “Constraint satisfaction problem” on English Wikipedia
Read “制約充足問題” on Japanese Wikipedia
Read “Constraint satisfaction problem” on DBpedia
Read “Constraint satisfaction problem” on English Wikipedia
Read “制約充足問題” on Japanese Wikipedia
Read “Constraint satisfaction problem” on DBpedia
Discussions
Log in to talk about this word.