29908 search results - page 125 / 5982 » On the complexity of communication complexity |
140
click to vote
CASCON
1997
15 years 5 months ago
1997
Understanding distributed applications is a tedious and di cult task. Visualizations based on process-time diagrams are often used to obtain a better understanding of the executio...
134
click to vote
JAIR
2008
15 years 4 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
137
click to vote
PLDI
2011
ACM
14 years 7 months ago
2011
ACM
The performance benefits of GPU parallelism can be enormous, but unlocking this performance potential is challenging. The applicability and performance of GPU parallelizations is...
151
Voted
MOBIHOC
2007
ACM
16 years 4 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
133
Voted
FOSSACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...