2 search results - page 1 / 1 » Noisy K Best-Paths for Approximate Dynamic Programming with ... |
JCP
2007
13 years 4 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
ASPLOS
2009
ACM
14 years 5 months ago
2009
ACM
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...