366 search results - page 58 / 74 » Agent Compromises in Distributed Problem Solving |
AMEC
2003
Springer
14 years 19 days ago
2003
Springer
Digital information economies require information goods producers to learn how to position themselves within a potentially vast product space. Further, the topography of this spac...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Tags or observable features shared by a group of similar agents are effectively used in real and artificial societies to signal intentions and can be used to infer unobservable ...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
JETAI
2008
13 years 7 months ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...