465 search results - page 86 / 93 » On the Hardness of Range Assignment Problems |
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
95
Voted
EUROSYS
2006
ACM
15 years 6 months ago
2006
ACM
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
SENSYS
2009
ACM
15 years 4 months ago
2009
ACM
Sensor networks have the potential to empower domain experts from a wide range of fields. However, presently they are notoriously difficult for these domain experts to program, ...
102
click to vote
ICAC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we design, implement and evaluate AdaptGuard, a software service for guarding adaptive systems, such as QoS-adaptive servers, from instability caused by software an...