4255 search results - page 108 / 851 » On Learning Boolean Functions |
170
click to vote
ICML
2001
IEEE
16 years 7 months ago
2001
IEEE
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...
150
Voted
CHES
2004
Springer
15 years 11 months ago
2004
Springer
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 ...
207
Voted
COCO
1997
Springer
15 years 10 months ago
1997
Springer
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 ...
160
Voted
ICCAD
1993
IEEE
15 years 10 months ago
1993
IEEE
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...
158
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
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...