796 search results - page 74 / 160 » Approximating the centroid is hard |
ALGOSENSORS
2007
Springer
14 years 1 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
SI3D
2006
ACM
14 years 1 months ago
2006
ACM
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
FSTTCS
2003
Springer
14 years 28 days ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...