1274 search results - page 89 / 255 » The Geometry of Coin-Weighing Problems |
131
Voted
CAAN
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
96
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
106
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
120
Voted
DGCI
2009
Springer
15 years 1 months ago
2009
Springer
To find corresponding points in different poses of the same articulated shape, a non rigid coordinate system is used. Each pixel of each shape is identified by a pair of distinct c...
265
Voted
FAW
2010
Springer
15 years 1 months ago
2010
Springer
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...