Principles of Constraint Programming (inbunden)
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
420
Utgivningsdatum
2003-08-01
Förlag
Cambridge University Press
Illustratör/Fotograf
60 exercises 76 figures
Illustrationer
76figs. 60exercises
Dimensioner
255 x 180 x 25 mm
Vikt
980 g
Antal komponenter
1
Komponenter
68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam
ISBN
9780521825832
Principles of Constraint Programming (inbunden)

Principles of Constraint Programming

Inbunden, Engelska, 2003-08-01
559
Skickas inom 7-10 vardagar.
Fri frakt inom Sverige för privatpersoner.
Boken kan tyvärr inte levereras innan julafton.
Finns även som
Visa alla 2 format & utgåvor
Constraints are everywhere: most computational problems can be described in terms of restrictions imposed on the set of possible solutions, and constraint programming is a problem-solving technique that works by incorporating those restrictions in a programming environment. It draws on methods from combinatorial optimisation and artificial intelligence, and has been successfully applied in a number of fields from scheduling, computational biology, finance, electrical engineering and operations research through to numerical analysis. This textbook for upper-division students provides a thorough and structured account of the main aspects of constraint programming. The author provides many worked examples that illustrate the usefulness and versatility of this approach to programming, as well as many exercises throughout the book that illustrate techniques, test skills and extend the text. Pointers to current research, extensive historical and bibliographic notes, and a comprehensive list of references will also be valuable to professionals in computer science and artificial intelligence.
Visa hela texten

Passar bra ihop

  1. Principles of Constraint Programming
  2. +
  3. Optimal Solution of Nonlinear Equations

De som köpt den här boken har ofta också köpt Optimal Solution of Nonlinear Equations av Krzysztof A Sikorski (inbunden).

Köp båda 2 för 1218 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Krzysztof Apt

  • Logics and Models of Concurrent Systems

    Krzysztof Apt

    The cooperation test [Apt, Francez & de Roever] was originally conceived to capture the proof theoretical analogue of distributed message exchange between disjoint processes, as opposed to the interference freedom test [Owicki & Gries], be...

Recensioner i media

Review of the hardback: '... a fundamental new way of looking at constraint programming ... This book ... is a great present to the constraint programming community, which will certainly advance scientifically because of its publication. We need good books to educate new people to Constraint Programming in the best way, and this book is a great way to do this.' Theory and Practice of Logic Programming

Review of the hardback: '... a fundamental new way of looking at constraint programming ... done with the highest level of precision and formality, without however making the reading task too heavy, as it is typical of Apt's writing style ... I really enjoyed reading Apt's book and am using it for my current course on constraint programming ... it is extremely well written ... the formal style never makes reading a heavy task ... it provides a very original abstract view of the main concepts of constraint propagation and constraint programming, which can be very useful both for beginners who need to understand[ing] these concepts without getting lost, and also for experienced researchers ... I have always been stunned by his exceptional ability to be formal and clear. This book is yet another witness for this ability ... a great present to the constraint programming community, which will certainly advance scientifically because of its publication. Journal of TLP

Bloggat om Principles of Constraint Programming

Innehållsförteckning

1. Introduction; 2. Constraint satisfaction problems: Examples; 3. Constraint programming in a nutshell; 4. Some complete constraint solvers; 5. Local consistency notions; 6. Some incomplete constraint solvers; 7. Constraint propagation algorithms; 8. Search; 9. General programming issues; Bibliography; Index.