7133 search results - page 120 / 1427 » Communication algorithms with advice |
DALT
2008
Springer
13 years 12 months ago
2008
Springer
We propose a variant of alternating time temporal logic (ATL) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be ...
PPOPP
2010
ACM
14 years 7 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
MOBICOM
2006
ACM
14 years 4 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
COCO
2010
Springer
14 years 2 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...