475 search results - page 70 / 95 » Feasible distributed CSP models for scheduling problems |
AAAI
2000
13 years 9 months ago
2000
We present a new domain for unsupervised learning: automatically customizing the computer to a specific melodic performer by merely listening to them improvise. We also describe B...
PPOPP
2010
ACM
14 years 2 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
SC
2003
ACM
14 years 23 days ago
2003
ACM
Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major ...
HIPC
2007
Springer
13 years 11 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
HIPC
2009
Springer
13 years 5 months ago
2009
Springer
The significant growth in computational power of modern Graphics Processing Units(GPUs) coupled with the advent of general purpose programming environments like NVIDA's CUDA,...