Sciweavers

1945 search results - page 154 / 389
» Speeding up Serpent
Sort
View
ICML
2006
IEEE
16 years 11 days ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
ISPD
2006
ACM
103views Hardware» more  ISPD 2006»
16 years 11 days ago
High accurate pattern based precondition method for extremely large power/ground grid analysis
In this paper, we propose more accurate power/ground network circuit model, which consider both via and ground bounce effects to improve the performance estimation accuracy of on-...
Jin Shi, Yici Cai, Sheldon X.-D. Tan, Xianlong Hon...
ML
2006
ACM
122views Machine Learning» more  ML 2006»
16 years 11 days ago
Type-safe modular hash-consing
Hash-consing is a technique to share values that are structurally equal. Beyond the obvious advantage of saving memory blocks, hash-consing may also be used to speed up fundamenta...
Jean-Christophe Filliâtre, Sylvain Conchon
NETGAMES
2006
ACM
16 years 11 days ago
Hack-proof synchronization protocol for multi-player online games
Synchronization protocols based on “dead-reckoning” are vulnerable to a popular type of cheat called speed-hack. A speed-hack helps a cheater to gain unfair advantages by essen...
Yeung Siu Fung
VRST
2006
ACM
16 years 11 days ago
A reprocessing tool for quantitative data analysis in a virtual environment
This paper presents an approach to help speed up and unify the exploration and analysis of time-dependent, volumetric data sets by easily incorporating new qualitative and quantit...
Eric J. Griffith, Michal Koutek, Frits H. Post, T....