Articoli correlati a Constraint satisfaction problem: Constraint (mathematics),...

Constraint satisfaction problem: Constraint (mathematics), Variable (mathematics), Constraint satisfaction, Artificial intelligence, Operations research - Brossura

 
9786132777249: Constraint satisfaction problem: Constraint (mathematics), Variable (mathematics), Constraint satisfaction, Artificial intelligence, Operations research

Sinossi

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Constraint satisfaction problems or CSPs 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. CSPs are the subject of intense research in both artificial intelligence and operations research, since the regularity in their formulation provides a common basis to analyze and solve problems of many unrelated families. CSPs often exhibit high complexity, requiring a combination of heuristics and combinatorial search methods to be solved in a reasonable time.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.