Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems - Mohamed Wahbi

angļu valoda
2013-07-10
228,10 € 350,93 €

-35% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 31-37 darba dienu laikā

30 dienu atgriešanas politika

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 kn ... Pilns apraksts

Aprašymas

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 of the problem, i.e. 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.

Vairāk informācijas

Autors Mohamed Wahbi
Izdevējs Wiley
Izlaides gads 2013
Vāka tips Cietais vāks
EAN 9781848215948
Rakstiet savu atsauksmi
Jūs vērtējat: Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
Jūsu novērtējums:

Goodreads atsauksmes

228,10 € 350,93 €