menu
{ "item_title" : "Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems", "item_author" : [" Mohamed Wahbi "], "item_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.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/1/84/821/594/1848215940_b.jpg", "price_data" : { "retail_price" : "177.95", "online_price" : "177.95", "our_price" : "177.95", "club_price" : "177.95", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems|Mohamed Wahbi

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

local_shippingShip to Me
On Order. Usually ships in 2-4 weeks
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9781848215948
  • ISBN-10: 1848215940
  • Publisher: Wiley-Iste
  • Publish Date: July 2013
  • Dimensions: 9.2 x 6.4 x 0.7 inches
  • Shipping Weight: 0.95 pounds
  • Page Count: 176

Related Categories

You May Also Like...

    1

BAM Customer Reviews