6251 search results - page 926 / 1251 » Randomness, Computability, and Density |
203
click to vote
SIGECOM
2004
ACM
16 years 27 days ago
2004
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
198
Voted
SPAA
2004
ACM
16 years 27 days ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
221
click to vote
DIALM
2003
ACM
16 years 22 days ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
214
Voted
CCS
2003
ACM
16 years 21 days ago
2003
ACM
Network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate “stepping stones” to conceal their identity and origin...
237
click to vote
EDCC
2010
Springer
16 years 8 days ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...