Minimizing Communication Costs of Distributed Local Computation ∗

@inproceedings{Pouly2005MinimizingCC,
  title={Minimizing Communication Costs of Distributed Local Computation ∗},
  author={Marc Pouly and J{\"u}rg Kohlas},
  year={2005}
}
A valuation algebra offers a suitable framework to represent knowledge and information. Based on this framework, several algorithms to process knowledge and pooled under the name local computation were mapped out in recent years. This paper proposes an extension of the valuation algebra framework that allows to express the costs of transmitting valuations between network hosts. Based on this model, we estimate the total computation costs caused by the local computation architectures and observe… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

Axioms for Probability and Belief-Function Propagation

  • Classic Works of the Dempster-Shafer Theory of Belief Functions
  • 1988
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

Information algebras - generic structures for inference

  • Discrete mathematics and theoretical computer science
  • 2003
VIEW 8 EXCERPTS

The Complexity of Multiterminal Cuts

E. Dahlhaus, D. S. Johnson, Christos H. Papadimitriou, Paul Seymour, Mihalis Yannakakis
  • SIAM J. Comput.
  • 1994
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Upper and Lower Probabilities Induced by a Multivalued Mapping

A. P. Dempster
  • Annals of Math. Stat., 38, 325–339.
  • 1967
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Valuation Algebras Induced by Semirings

J. Kohlas
  • Tech. rept. 04-03. Department of Informatics, University of Fribourg.
  • 2004
VIEW 2 EXCERPTS