Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers

Georg RingwelskiContact Information

(5)  German National Research Center for Information Technology, GMD FIRST, Kekuléstraße 7, 12489 Berlin, Germany
Abstract
A Constraint Satisfaction Problem (CSP) is to find an assignment to a set of variables that is consistent wrt. a set of constraints over these variables. CSPs frequentlyarise in applications of distributed artificial intelligence [3] and may often not be solved bya centralized constraint solver for privacyor security reasons. In this distributed case (DCSP) constraints and variables are distributed among multiple automated agents.

Contact Information Georg Ringwelski
Email: georg.ringwelski@gmd.de
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.107 • Server: mpweb19
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)