Sciweavers

2479 search results - page 416 / 496
» A Computational Theory of Working Memory
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 11 months ago
Equilibria in topology control games for ad hoc networks
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...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
GROUP
2003
ACM
15 years 11 months ago
How people use orientation on tables: comprehension, coordination and communication
In order to support co-located collaboration, many researchers are now investigating how to effectively augment tabletops with electronic displays. As far back as 1988, orientatio...
Russell Kruger, M. Sheelagh T. Carpendale, Stacey ...
MOBICOM
2003
ACM
15 years 11 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
SIGMETRICS
2010
ACM
233views Hardware» more  SIGMETRICS 2010»
15 years 10 months ago
Incentivizing peer-assisted services: a fluid shapley value approach
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
Vishal Misra, Stratis Ioannidis, Augustin Chaintre...
SPAA
1996
ACM
15 years 10 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher