115 search results - page 1 / 23 » Privacy Guarantees through Distributed Constraint Satisfacti... |
103
Voted
IAT
2008
IEEE
15 years 10 months ago
2008
IEEE
The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and co...
144
Voted
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
144
Voted
AAAI
2007
15 years 6 months ago
2007
Solving logic puzzles has become a very popular past-time, particularly since the Sudoku puzzle started appearing in newspapers all over the world. We have developed a puzzle gene...
148
click to vote
FLAIRS
2004
15 years 5 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
132
click to vote
AGENTS
2001
Springer
15 years 8 months ago
2001
Springer
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...