Sciweavers

4835 search results - page 557 / 967
» Refactoring Functional Programs
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
OSDI
2006
ACM
16 years 7 months ago
From Uncertainty to Belief: Inferring the Specification Within
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
Ted Kremenek, Paul Twohey, Godmar Back, Andrew Y. ...
AMAI
2004
Springer
16 years 6 days ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
ASM
2004
ASM
16 years 6 days ago
Intra-step Interaction
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
Yuri Gurevich
ICALP
2007
Springer
15 years 8 months ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou