4586 search results - page 682 / 918 » Computing stable models in parallel |
173
click to vote
SPAA
1994
ACM
15 years 8 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
173
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
140
click to vote
COORDINATION
2006
Springer
15 years 7 months ago
2006
Springer
In a previous work we have presented a formal framework devoted to show the relevance of choreography and orchestration in the design of service oriented applications. Even if usef...
131
click to vote
GRID
2006
Springer
15 years 4 months ago
2006
Springer
Manual management of public key credentials can be a significant and often off-putting obstacle to Grid use, particularly for casual users. We describe the Portal-based User Regis...
141
click to vote
CLUSTER
2004
IEEE
15 years 3 months ago
2004
IEEE
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...