2473 search results - page 441 / 495 » The Logic of Communication Graphs |
ENTCS
2002
13 years 7 months ago
2002
In this work we present Zeus, a Distributed Model-Checker that evolves from the tool Kronos [8] and that currently can handle backwards computation of TCTLreachability properties ...
PPL
2000
13 years 7 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
MST
2002
13 years 7 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
MMS
2007
13 years 7 months ago
2007
In this paper, we develop a theoretical understanding of multi-sensory knowledge and user context and their interrelationships. This is used to develop a generic representation fr...
SWAT
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...