475 search results - page 38 / 95 » Feasible distributed CSP models for scheduling problems |
125
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
154
Voted
RTAS
2005
IEEE
15 years 10 months ago
2005
IEEE
No one middleware communication model completely solves the problem of ensuring schedulability in every DRE system. Furthermore, there have been few studies to date of the trade-o...
189
click to vote
QEST
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
158
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
141
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...