1528 search results - page 150 / 306 » On Signatures for Communication Graphs |
172
click to vote
WDAG
2007
Springer
16 years 13 days ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
179
click to vote
ISCC
2005
IEEE
15 years 12 months ago
2005
IEEE
The use of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-toPeer (P2P) Networks. In this paper, we study the performance of Yao-G...
163
click to vote
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
167
click to vote
ACSD
1998
IEEE
15 years 10 months ago
1998
IEEE
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
189
click to vote
ICSE
1999
IEEE-ACM
15 years 10 months ago
1999
IEEE-ACM
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...