188 search results - page 3 / 38 » Finding Best k Policies |
WDAG
2010
Springer
13 years 5 months ago
2010
Springer
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
PE
2006
Springer
13 years 7 months ago
2006
Springer
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?" Our settin...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
Verifying that access-control systems maintain desired security properties is recognized as an important problem in security. Enterprise access-control systems have grown to prote...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In the k-edge-connected spanning subgraph problem we are given a graph (V, E) and costs for each edge, and want to find a minimum-cost F E such that (V, F) is k-edge-connected. I...
EUROCAST
2007
Springer
14 years 1 months ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...