Sciweavers

194 search results - page 19 / 39
» Approximate dynamic programming: Lessons from the field
Sort
View
ASPLOS
2009
ACM
14 years 8 months ago
RapidMRC: approximating L2 miss rate curves on commodity systems for online optimizations
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...
David K. Tam, Reza Azimi, Livio Soares, Michael St...
JAIR
2010
115views more  JAIR 2010»
13 years 6 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
JAIR
2008
126views more  JAIR 2008»
13 years 7 months ago
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos A. ...
ICS
2009
Tsinghua U.
14 years 2 months ago
Adagio: making DVS practical for complex HPC applications
Power and energy are first-order design constraints in high performance computing. Current research using dynamic voltage scaling (DVS) relies on trading increased execution time...
Barry Rountree, David K. Lowenthal, Bronis R. de S...
JCC
2006
103views more  JCC 2006»
13 years 7 months ago
Flooding in GROMACS: Accelerated barrier crossings in molecular dynamics
: The major bottleneck of today's atomistic molecular dynamics (MD) simulations is that because of the enormous computational effort involved, only processes at nanoseconds to...
Oliver F. Lange, Lars V. Schäfer, Helmut Grub...