Sciweavers

54 search results - page 4 / 11
» The Worst Page-Replacement Policy
Sort
View
ECRTS
2009
IEEE
13 years 7 months ago
Using Randomized Caches in Probabilistic Real-Time Systems
While hardware caches are generally effective at improving application performance, they greatly complicate performance prediction. Slight changes in memory layout or data access p...
Eduardo Quiñones, Emery D. Berger, Guillem ...
ISCC
2005
IEEE
14 years 3 months ago
Trie-Based Policy Representations for Network Firewalls
Network firewalls remain the forefront defense for most computer systems. These critical devices filter traffic by comparing arriving packets to a list of rules, or security po...
Errin W. Fulp, Stephen J. Tarsa
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 9 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
SC
2009
ACM
14 years 4 months ago
Evaluating the impact of inaccurate information in utility-based scheduling
Proponents of utility-based scheduling policies have shown the potential for a 100–1400% increase in value-delivered to users when used in lieu of traditional approaches such as...
Alvin AuYoung, Amin Vahdat, Alex C. Snoeren
GRID
2003
Springer
14 years 3 months ago
Policy and Enforcement in Virtual Organizations
Arguably, the main goal of Grid Computing is to facilitate the creation of Virtual Organizations (VOs); however, to date, not enough attention has been placed on the policies and ...
Glenn S. Wasson, Marty Humphrey