1528 search results - page 152 / 306 » On Signatures for Communication Graphs |
140
click to vote
CASES
2009
ACM
16 years 26 days ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
192
click to vote
ICOIN
2007
Springer
16 years 14 days ago
2007
Springer
Exploring topological structure at Autonomous System (AS) level is indispensable for understanding most issues in Internet services. Previous models of AS graph involve address or ...
154
click to vote
MSN
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
158
click to vote
TACAS
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
122
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...