Sciweavers

1236 search results - page 16 / 248
» Efficient Interpretation Policies
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Monte-Carlo simulation balancing
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
David Silver, Gerald Tesauro
COMPSEC
2004
105views more  COMPSEC 2004»
13 years 7 months ago
Rico: a security proxy for mobile code
Security technology suitable for the burgeoning embedded system market has not been widespread. Untrusted code downloaded from the Internet poses numerous security risks due to th...
Yougang Song, Brett D. Fleisch
POPL
2004
ACM
14 years 7 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
POPL
2003
ACM
14 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
ICDE
2006
IEEE
174views Database» more  ICDE 2006»
14 years 9 months ago
Extending RDBMSs To Support Sparse Datasets Using An Interpreted Attribute Storage Format
"Sparse" data, in which relations have many attributes that are null for most tuples, presents a challenge for relational database management systems. If one uses the no...
Jennifer L. Beckmann, Alan Halverson, Rajasekar Kr...