4255 search results - page 220 / 851 » On Learning Boolean Functions |
149
click to vote
UIST
1994
ACM
15 years 10 months ago
1994
ACM
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
157
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
175
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
205
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...
149
click to vote
ICANN
2005
Springer
16 years 1 days ago
2005
Springer
In this paper we introduce feedback based associative learning in self-organized learning arrays (SOLAR). SOLAR structures are hierarchically organized and have the ability to clas...