465 search results - page 72 / 93 » On the Hardness of Range Assignment Problems |
SIGMETRICS
2002
ACM
14 years 11 months ago
2002
ACM
Scheduling in large-scale parallel systems has been and continues to be an important and challenging research problem. Several key factors, including the increasing use of off-the...
162
click to vote
PODS
2009
ACM
16 years 13 days ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
ISCA
2009
IEEE
15 years 6 months ago
2009
IEEE
As transistor density continues to grow at an exponential rate in accordance to Moore’s law, the goal for many Chip Multi-Processor (CMP) systems is to scale the number of on-ch...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...