5922 search results - page 484 / 1185 » Navigability of Complex Networks |
139
click to vote
PERCOM
2010
ACM
15 years 3 months ago
2010
ACM
—This paper shows how to reduce evaluation time for context inference. Probabilistic Context Inference has proven to be a good representation of the physical reality with uncerta...
149
click to vote
TON
2010
14 years 11 months ago
2010
OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an...
173
click to vote
AAAI
2011
14 years 5 months ago
2011
Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the ...
147
click to vote
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
150
click to vote
CONEXT
2009
ACM
15 years 6 months ago
2009
ACM
Shipping-container-based data centers have been introduced as building blocks for constructing mega-data centers. However, it is a challenge on how to interconnect those container...