Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Explanation and prediction: an architecture for default and abductive reasoning
Computational Intelligence
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Optimal time randomized consensus—making resilient algorithms fast in practice
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Spreading rumors rapidly despite an adversary
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Argumentation as distributed constraint satisfaction: applications and results
Proceedings of the fifth international conference on Autonomous agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Directional Gossip: Gossip in a Wide Area Network
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
A protocol for multi-agent diagnosis with spatially distributed knowledge
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Reaching Diagnostic Agreement in Multi-Agent Diagnosis
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
ArgMAS'04 Proceedings of the First international conference on Argumentation in Multi-Agent Systems
SMILE: Sound Multi-agent Incremental LEarning
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Hypotheses refinement under topological communication constraints
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
| Hi-index | 0.00 |
This paper discusses the problem of efficient propagation of uncertain information in dynamic environments and critical situations. When a number of (distributed) agents have only partial access to information, the explanation(s) and conclusion(s) they can draw from their observations are inevitably uncertain. In this context, the efficient propagation of information is concerned with two interrelated aspects: spreading the information as quickly as possible, and refining the hypotheses at the same time. We describe a formal framework designed to investigate this class of problem, and we report on preliminary results and experiments using the described theory.