103 search results - page 21 / 21 » An Asymptotically Optimal Bandit Algorithm for Bounded Suppo... |
STOC
1999
ACM
13 years 8 months ago
1999
ACM
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
MST
2000
13 years 4 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
COMPGEOM
2003
ACM
13 years 9 months ago
2003
ACM
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...