4411 search results - page 90 / 883 » Communication Complexity and Its Applications |
147
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
123
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— With the explosive growth of network techniques, in particular wireless communications, the traditional centralized, fixed networks can no longer satisfy the enormous demands ...
139
click to vote
ECCC
2008
15 years 4 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
147
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
235
click to vote
HOTI
2011
IEEE
14 years 3 months ago
2011
IEEE
—There are many APIs for connecting and exchanging data between network peers. Each interface varies wildly based on metrics including performance, portability, and complexity. S...