2473 search results - page 58 / 495 » The Logic of Communication Graphs |
131
Voted
AICOM
2006
15 years 3 months ago
2006
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
171
click to vote
TMC
2012
13 years 5 months ago
2012
—A major benefit of employing network coding (NC) in cooperative communications (CC) is its ability to reduce time-slot overhead. Such approach is called network-coded CC (or NC...
138
click to vote
KR
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a theory of informative communications among agents that allows a speaker to communicate to a hearer truths about the state of the world; the occurrence of eve...
122
click to vote
AI
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a theory of informative communications among agents that allows a speaker to communicate to a hearer truths about the state of the world; the occurrence of eve...
101
Voted
EUROPAR
2007
Springer
15 years 9 months ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...