818 search results - page 78 / 164 » Network bargaining: algorithms and structural results |
184
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
167
click to vote
FGCS
2008
15 years 4 months ago
2008
The World Wide Web is growing at such a pace that even the biggest centralized search engines are able to index only a small part of the available documents on the Internet. The d...
157
Voted
INFOCOM
2009
IEEE
16 years 13 days ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
162
click to vote
IPSN
2009
Springer
16 years 17 days ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
147
click to vote
INFOCOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...