Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
- Binding:
- Hardback
- Pages:
- 176
- Published:
- June 24, 2013
- Dimensions:
- 163x241x20 mm.
- Weight:
- 447 g.
Delivery:
2-4 weeks
Expected delivery: May 9, 2025
Description of Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm.
User ratings of Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2025 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
