2714 search results - page 172 / 543 » Approximation Schemes for Scheduling |
138
Voted
TIP
2002
15 years 19 days ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
QUESTA
2007
15 years 14 days ago
2007
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
111
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper, we consider the problem of manifold approximation with affine subspaces. Our objective is to discover a set of low dimensional affine subspaces that represents ma...
142
Voted
LCTRTS
2000
Springer
15 years 4 months ago
2000
Springer
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
132
Voted
WADS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...