4255 search results - page 205 / 851 » On Learning Boolean Functions |
191
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
197
click to vote
EUROCOLT
1999
Springer
15 years 10 months ago
1999
Springer
We study the learnability of first order Horn expressions from equivalence and membership queries. We show that the class of expressions where every term in the consequent of a c...
134
click to vote
WINE
2007
Springer
16 years 18 days ago
2007
Springer
A function is non-cooperative computable [NCC] if honest agents can compute it by reporting truthfully their private inputs, while unilateral deviations by the players are not bene...
180
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...
184
click to vote
BLISS
2009
IEEE
15 years 7 months ago
2009
IEEE
Self configuring VLSI technology architectures offer a new environment for creating novel security functions. Two such functions for physical security architectures are proposed t...