2473 search results - page 108 / 495 » The Logic of Communication Graphs |
ASIAMS
2007
IEEE
14 years 3 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
DATE
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we use the generalized binary de Bruijn (GBDB) graph as a scalable and efficient network topology for an on-chip communication network. Using just two-layer wiring,...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— We propose a unifying framework for max-min fairness in orthogonal networks and networks with interference. First, a universal formulation of the max-min fairness problem for o...
AINA
2010
IEEE
14 years 1 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
LORI
2009
Springer
14 years 3 months ago
2009
Springer
We propose a dynamic testimonial logic (DTL) to model communication and belief change among agents with different dispositions to trust each other as information sources. DTL is ...