A01=Christophe Lecoutre
acronyms
algorithms introduction
Author_Christophe Lecoutre
Category=UY
consistencies
constraint networks
data structures
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
examples
gac algorithms
list
main
networks
notation
orders
propagation
stability
valid tuples
variables
Product details
- ISBN 9781848211063
- Weight: 980g
- Dimensions: 163 x 241mm
- Publication Date: 10 Jul 2009
- Publisher: ISTE Ltd and John Wiley & Sons Inc
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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 to be solved or the type of constraints involved, making it an extremely user-friendly resource for those involved in this field.
Christophe Lecoutre is Assistant Professor at the University of Artois, France.
