874 search results - page 114 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
153
click to vote
COR
2010
15 years 4 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
104
Voted
SC
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
145
Voted
SOFSEM
2010
Springer
16 years 28 days ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
139
click to vote
TASE
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract--Cluster tools are widely used as semiconductor manufacturing equipment. While throughput analysis and scheduling of single-cluster tools have been well-studied, research ...
125
click to vote
WADS
1997
Springer
15 years 8 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...