4255 search results - page 172 / 851 » On Learning Boolean Functions |
141
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
134
click to vote
FLAIRS
2003
15 years 3 months ago
2003
In this paper, we present an experimental methodology and results for a machine learning approach to learning opening strategy in the game of Go, a game for which the best compute...
126
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
124
Voted
IJCAI
2001
15 years 3 months ago
2001
Consider a supervised learning problem in which examples contain both numerical- and text-valued features. To use traditional featurevector-based learning methods, one could treat...
116
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...