Sciweavers

4255 search results - page 108 / 851
» On Learning Boolean Functions
Sort
View
ICML
2001
IEEE
15 years 10 months ago
Off-Policy Temporal Difference Learning with Function Approximation
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
Doina Precup, Richard S. Sutton, Sanjoy Dasgupta
CHES
2004
Springer
130views Cryptology» more  CHES 2004»
15 years 3 months ago
Switching Blindings with a View Towards IDEA
Cryptographic algorithms implemented on smart-cards must be protected against side-channel attacks. Some encryption schemes and hash functions like IDEA, RC6, MD5, SHA-1 alternate ...
Olaf Neiße, Jürgen Pulkus
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 2 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
15 years 2 months ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 10 months ago
Combining decision procedures for the reals
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
Jeremy Avigad, Harvey Friedman