Sciweavers

1407 search results - page 20 / 282
» Learning Abstract Scheduling Models
Sort
View
IPPS
1998
IEEE
14 years 3 months ago
Multiprocessor Scheduling Using Mean-Field Annealing
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...
Shaharuddin Salleh, Albert Y. Zomaya
TOPNOC
2010
13 years 5 months ago
Schedule-Aware Workflow Management Systems
Abstract. Contemporary workflow management systems offer workitems to users through specific work-lists. Users select the work-items they will perform without having a specific sch...
Ronny Mans, Nick C. Russell, Wil M. P. van der Aal...
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 9 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
ICML
2010
IEEE
13 years 9 months ago
Approximate Predictive Representations of Partially Observable Systems
We provide a novel view of learning an approximate model of a partially observable environment from data and present a simple implemenf the idea. The learned model abstracts away ...
Monica Dinculescu, Doina Precup
CCGRID
2008
IEEE
14 years 5 months ago
Grid Differentiated Services: A Reinforcement Learning Approach
—Large scale production grids are a major case for autonomic computing. Following the classical definition of Kephart, an autonomic computing system should optimize its own beha...
Julien Perez, Cécile Germain-Renaud, Bal&aa...