465 search results - page 3 / 93 » On the Hardness of Range Assignment Problems |
STOC
2007
ACM
16 years 19 hour ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
DATE
2008
IEEE
15 years 6 months ago
2008
IEEE
—Increasing integrated circuit (IC) power densities and temperatures may hamper multiprocessor system-on-chip (MPSoC) use in hard real-time systems. This article formalizes the t...
142
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
DIALM
2008
ACM
15 years 1 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...