2473 search results - page 132 / 495 » The Logic of Communication Graphs |
CC
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
EJC
2010
13 years 10 months ago
2010
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
ENTCS
2006
13 years 10 months ago
2006
Back-pressure is a logical mechanism to control the flow of information on a communication channel of a latency-insensitive system (LIS) while guaranteeing that no packet is lost....
IPSN
2009
Springer
14 years 5 months ago
2009
Springer
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...