1154 search results - page 215 / 231 » Mathematizing C concurrency |
172
click to vote
MOBICOM
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
150
Voted
MOBICOM
2006
ACM
15 years 10 months ago
2006
ACM
Characterizing mobility or contact patterns in a campus environment is of interest for a variety of reasons. Existing studies of these patterns can be classified into two basic a...
169
Voted
PODC
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
147
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
148
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...