1901 search results - page 100 / 381 » Models and Scheduling Mechanisms for Global Computing Applic... |
110
click to vote
ESOP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
133
click to vote
ICPR
2006
IEEE
16 years 2 months ago
2006
IEEE
We present a method for solving the global illumination problem for synthetic diffuse objects. The approach generates realistic shading for applications where a synthetic object i...
146
click to vote
SIGECOM
2005
ACM
15 years 7 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
132
click to vote
COMCOM
2006
15 years 1 months ago
2006
There exists a high demand for reliable, high capacity underwater acoustic networks to allow efficient data gathering and information exchange. This is evidenced by significant re...
103
click to vote
IPL
2008
15 years 1 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...