4255 search results - page 98 / 851 » On Learning Boolean Functions |
139
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Highly regular, nanodevice based architectures have been proposed to replace pure CMOS based architectures in the emerging post CMOS era. Since bottom-up self-assembly is used to ...
157
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
174
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
169
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
175
click to vote
CIG
2005
IEEE
15 years 11 months ago
2005
IEEE
AbstractGroup utility functions are an extension of the common team utility function for providing multiple agents with a common reinforcement learning signal for learning cooperat...