Электронная книга: Christophe Lecoutre «Constraint Networks. Targeting Simplicity for Techniques and Algorithms»
|
A major challenge in constraint programming is to develop efficient generic approaches to solve instances of the constraint satisfaction problem (CSP). With this aim in mind, this book provides an accessible synthesis of the author's research and work in this area, divided into four main topics: representation, inference, search, and learning. The results obtained and reproduced in this book have a wide applicability, regardless of the nature of the problem or the constraints involved, making it an extremely user-friendly resource for those involved in this field. Издательство: "John Wiley&Sons Limited"
ISBN: 9780470610381 электронная книга Купить за 23258.13 руб и скачать на Litres |
Другие книги схожей тематики:
| Автор | Книга | Описание | Год | Цена | Тип книги |
|---|
См. также в других словарях:
Problème de satisfaction de contrainte — Problème de satisfaction de contraintes Les problèmes de satisfaction de contrainte ou CSP (Constraint Satisfaction Problem) sont des problèmes mathématiques où l on cherche des états ou des objets satisfaisant un certain nombre de contraintes ou … Wikipédia en Français
Problème de satisfaction de contraintes — Les problèmes de satisfaction de contraintes ou CSP (Constraint Satisfaction Problem) sont des problèmes mathématiques où l on cherche des états ou des objets satisfaisant un certain nombre de contraintes ou de critères. Les CSP font l objet de… … Wikipédia en Français
Constraint satisfaction problem — Constraint 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… … Wikipedia
Constraint satisfaction — In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a vector of variables that… … Wikipedia
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
