Constraint Satisfaction Problems – CSP Formalisms and Techniques : CSP Formalisms and Techniques
Book Details
Format
Hardback or Cased Book
ISBN-10
184821460X
ISBN-13
9781848214606
Publisher
ISTE Ltd and John Wiley & Sons Inc
Imprint
ISTE Ltd and John Wiley & Sons Inc
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Jan 18th, 2013
Print length
240 Pages
Weight
552 grams
Dimensions
24.10 x 16.00 x 2.50 cms
Product Classification:
Mathematical logic
Ksh 25,000.00
Werezi Extended Catalogue
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied.
A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their high complexity and their omnipresence in academic, industrial and even real-life problems. This is why they are the subject of intense research in both artificial intelligence and operations research. This book introduces the classic CSP and details several extensions/improvements of both formalisms and techniques in order to tackle a large variety of problems. Consistency, flexible, dynamic, distributed and learning aspects are discussed and illustrated using simple examples such as the n-queen problem.
Get Constraint Satisfaction Problems – CSP Formalisms and Techniques by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by ISTE Ltd and John Wiley & Sons Inc and it has pages.
