Sciweavers

475 search results - page 53 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
CCGRID
2006
IEEE
15 years 10 months ago
Learning-Based Negotiation Strategies for Grid Scheduling
One of the key requirement for Grid infrastructures is the ability to share resources with nontrivial qualities of service. However, resource management in a decentralized infrast...
Jiadao Li, Ramin Yahyapour
MST
2000
57views more  MST 2000»
15 years 4 months ago
On Scheduling Parallel Tasks at Twilight
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...
Hannah Bast
IPPS
2010
IEEE
15 years 2 months ago
Towards dynamic reconfigurable load-balancing for hybrid desktop platforms
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...
Alécio Pedro Delazari Binotto, Carlos Eduar...
COLCOM
2008
IEEE
15 years 11 months ago
Learning Models of the Negotiation Partner in Spatio-temporal Collaboration
Abstract. We describe an approach for learning the model of the opponent in spatio-temporal negotiation. We use the Children in the Rectangular Forest canonical problem as an examp...
Yi Luo, Ladislau Bölöni
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 8 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld