544 search results - page 61 / 109 » What cannot be computed locally! |
97
Voted
SIGECOM
2003
ACM
15 years 5 months ago
2003
ACM
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
113
click to vote
SIGLEX
1991
15 years 4 months ago
1991
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
111
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
107
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that o...
94
Voted
ENTCS
2006
15 years 17 days ago
2006
The Web poses novel and interesting problems for both programming language design and verification--and their intersection. This paper provides a personal outline of one thread of...