Sciweavers

7160 search results - page 1089 / 1432
» Organizing Multiagent Systems
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 11 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
AGENTS
2000
Springer
15 years 11 months ago
Adaptivity in agent-based routing for data networks
Adaptivity, both of the individual agents and of the interaction structure among the agents, seems indispensable for scaling up multi-agent systems MAS's in noisy environme...
David Wolpert, Sergey Kirshner, Christopher J. Mer...
ATAL
2007
Springer
15 years 10 months ago
Model-based belief merging without distance measures
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
Verónica Borja Macías, Pilar Pozos P...
176
Voted
ATAL
2006
Springer
15 years 10 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
ATAL
2006
Springer
15 years 10 months ago
Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma)
This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "coop...
Tsz-Chiu Au, Dana S. Nau
« Prev « First page 1089 / 1432 Last » Next »