8825 search results - page 229 / 1765 » All for one or one for all |
101
click to vote
ENTCS
2000
15 years 1 months ago
2000
In this paper we consider two descriptions in Maude of the leader election protocol from the IEEE 1394 serial multimedia bus. Particularly, the time aspects of the protocol are st...
105
click to vote
DM
2002
15 years 1 months ago
2002
Let ^G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the...
96
Voted
ISCI
2000
15 years 1 months ago
2000
Storage subsystems have become one of the most important components in computer systems nowadays and have been expanded to include all three levels of memory hierarchy, namely the...
100
click to vote
CPC
1998
15 years 1 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
IPL
2002
15 years 1 months ago
2002
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...