88 search results - page 6 / 18 » Improved Bounds and Schemes for the Declustering Problem |
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
COMPGEOM
2010
ACM
14 years 26 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
TROB
2002
13 years 7 months ago
2002
In this paper, we present two globally convergent vision-based position controllers for a planar two-links manipulator in the so-called fixed-camera configuration, where the camera...
WINET
2011
13 years 2 months ago
2011
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
CCCG
2003
13 years 9 months ago
2003
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encod...