Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9650047 | Artificial Intelligence | 2005 | 28 Pages |
Abstract
We compare the algorithms through experiments on randomly generated problems. We show that in certain cases, open constraint programming can require significantly less information than traditional methods where gathering information and solving the CSP are separated. This leads to a reduction in network traffic and server load, and improves privacy in distributed problem solving.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Boi Faltings, Santiago Macho-Gonzalez,