7133 search results - page 124 / 1427 » Communication algorithms with advice |
142
click to vote
IEEEPACT
1998
IEEE
15 years 8 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
148
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
134
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
147
click to vote
DFG
2009
Springer
15 years 11 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
140
click to vote
EMSOFT
2009
Springer
15 years 11 months ago
2009
Springer
Concurrent programming languages are growing in importance with the advent of multi-core systems. However, concurrent programs suffer from problems, such as data races and deadloc...