Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
Book Details
Format
Hardback or Cased Book
ISBN-10
1848215940
ISBN-13
9781848215948
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
Jun 25th, 2013
Print length
176 Pages
Weight
447 grams
Dimensions
24.10 x 16.30 x 2.00 cms
Product Classification:
Systems analysis & designSystems analysis and design
Ksh 25,000.00
Werezi Extended Catalogue
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
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.
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. However, there are several applications in multi-agent coordination that are of a distributed nature. In this type of application, the knowledge about the problem, that is, variables and constraints, may be logically or geographically distributed among physical distributed agents. This distribution is mainly due to privacy and/or security requirements. Therefore, a distributed model allowing a decentralized solving process is more adequate to model and solve such kinds of problem. The distributed constraint satisfaction problem has such properties.
Get Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems 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.
