Sciweavers

344 search results - page 64 / 69
» Some Theorems We Should Prove
Sort
View
UAI
2008
13 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
ACISP
2006
Springer
14 years 1 months ago
On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
Nicolas Courtois, Blandine Debraize, Eric Garrido
ECOOP
2004
Springer
13 years 11 months ago
A Reflective Approach to Dynamic Software Evolution
In this paper, we present a solution that allows systems to remain active while they are evolving. Our approach goes out from the principle of separated concerns and has two steps....
Peter Ebraert, Tom Tourwé
PR
2008
132views more  PR 2008»
13 years 7 months ago
Measuring linearity of planar point sets
Our goal is to design algorithms that give a linearity measure for planar point sets. There is no explicit discussion on linearity in literature, although some existing shape meas...
Milos Stojmenovic, Amiya Nayak, Jovisa D. Zunic
WWW
2003
ACM
14 years 8 months ago
Adaptive on-line page importance computation
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
Serge Abiteboul, Mihai Preda, Gregory Cobena