2714 search results - page 314 / 543 » Approximation Schemes for Scheduling |
141
Voted
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
144
click to vote
PODS
2004
ACM
16 years 4 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
174
click to vote
SWAT
2010
Springer
15 years 9 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
135
click to vote
ICCAD
2006
IEEE
16 years 25 days ago
2006
IEEE
Energy-efficiency and power-awareness for electronic systems have been important design issues in hardware and software implementations. We consider the scheduling of periodic ha...
123
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper presents a standing balance controller. We employ a library of optimal trajectories and the neighboring optimal control method to generate local approximations to th...