1941 search results - page 301 / 389 » On the Hardness of Approximate Reasoning |
234
click to vote
MOBIHOC
2007
ACM
16 years 5 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
184
click to vote
MOBIHOC
2007
ACM
16 years 5 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
164
click to vote
MOBIHOC
2003
ACM
16 years 5 months ago
2003
ACM
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
161
click to vote
MOBIHOC
2003
ACM
16 years 5 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
177
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...