Sciweavers

7133 search results - page 94 / 1427
» Communication algorithms with advice
Sort
View
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
14 years 1 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
PERCOM
2010
ACM
13 years 7 months ago
Gateway designation for timely communications in instant mesh networks
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
Bo Xing, Mayur Deshpande, Sharad Mehrotra, Nalini ...
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
14 years 3 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
Minghui Zhu, Sonia Martínez
COORDINATION
2009
Springer
14 years 9 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
POPL
2001
ACM
14 years 9 months ago
Nomadic pict: correct communication infrastructure for mobile computation
This paper addresses the design and verification of infrastructure for mobile computation. In particular, we study language primitives for communication between mobile agents. The...
Asis Unyapoth, Peter Sewell