Shopping Cart
0 Item in Cart

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
Click for related books: Mohamed Wahbi

Rating  
(80 Ratings)

Retail Price: 5383.00/-
Price: 4307.00/-
Inclusive all taxes
20.00% OFF
Sold By: Store4Doctors

Offer 1: Get 20.00% + Flat ₹ 50 discount on shopping of ₹ 1500
                use code:
MPSTK50

Offer 2: Get 20.00% + Flat ₹ 150 discount on shopping of
                ₹ 5000 use code:
MPSTK150

Free Shipping (for orders above ₹ 499)  *T&C apply.

Only 1 Left In Stock Click For New Edition
Select Quantity :



Description

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.

More Details About Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
General Information
Author(s)Mohamed Wahbi
PublisherWiley
ISBN9781848215948
Pages176
BindingHardcover
LanguageEnglish
Publish YearJanuary 2013
Reviews of Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
Average Rating

Write A Review

TOP REVIEWS


Top Reviews lists the most relevant product reviews only.


RECENT TOP REVIEWS