Sciweavers

233 search results - page 17 / 47
» Composing and combining policies under the policy machine
Sort
View
INFOCOM
2005
IEEE
15 years 11 months ago
Optimizing cost-sensitive trust-negotiation protocols
Trust negotiation is a process that establishes mutual trust by the exchange of digital credentials and/or guiding policies among entities who may have no pre-existing knowledge a...
Weifeng Chen, L. Clarke, James F. Kurose, Donald F...
EWRL
2008
15 years 7 months ago
Regularized Fitted Q-Iteration: Application to Planning
We consider planning in a Markovian decision problem, i.e., the problem of finding a good policy given access to a generative model of the environment. We propose to use fitted Q-i...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
IPPS
2000
IEEE
15 years 10 months ago
Improving Throughput and Utilization in Parallel Machines through Concurrent Gang
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
Fabrício Alves Barbosa da Silva, Isaac D. S...
RTSS
2008
IEEE
16 years 14 days ago
Predictable Interrupt Management and Scheduling in the Composite Component-Based System
This paper presents the design of user-level scheduling hierarchies in the Composite component-based system. The motivation for this is centered around the design of a system that...
Gabriel Parmer, Richard West
IWLCS
2005
Springer
15 years 11 months ago
Counter Example for Q-Bucket-Brigade Under Prediction Problem
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
Atsushi Wada, Keiki Takadama, Katsunori Shimohara