874 search results - page 87 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
83
Voted
GLOBECOM
2007
IEEE
15 years 1 months ago
2007
IEEE
We consider optimal allocation of resources to users in a downlink OFDMA system to support heterogeneous applications consisting of both deadline-sensitive (DS) and best-effort (BE...
APPROX
2008
Springer
14 years 12 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
SWAT
1992
Springer
15 years 2 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
COR
2006
14 years 10 months ago
2006
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...