190 search results - page 9 / 38 » A Simple Proof Technique for Certain Parametricity Results |
INTEGRATION
2002
13 years 7 months ago
2002
Booth Recoding is a commonly used technique to recode one of the operands in binary multiplication. In this way the implementation of a multipliers' adder tree can be improve...
LICS
2000
IEEE
13 years 12 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
AIPS
2007
13 years 10 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
FOSSACS
2001
Springer
14 years 1 days ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...