Sciweavers

366 search results - page 5 / 74
» Agent Compromises in Distributed Problem Solving
Sort
View
DIS
2009
Springer
14 years 1 months ago
A Dialectic Approach to Problem-Solving
We analyze the dynamics of problem-solving in a framework which captures two key features of that activity. The first feature is that problem-solving is a social game where a numb...
Éric Martin, Jean Sallantin
AAAI
1997
13 years 8 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
AUSAI
2003
Springer
14 years 17 days ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar
AAAI
2007
13 years 9 months ago
Adaptive Traitor Tracing with Bayesian Networks
The practical success of broadcast encryption hinges on the ability to (1) revoke the access of compromised keys and (2) determine which keys have been compromised. In this work w...
Philip Zigoris, Hongxia Jin
JAIR
2008
104views more  JAIR 2008»
13 years 7 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes