z-logo
open-access-imgOpen Access
N-learners problem: Learning Boolean combinations of halfspaces
Author(s) -
N.S.V. Rao,
E.M. Oblow,
C.W. Glover
Publication year - 1992
Language(s) - English
Resource type - Reports
DOI - 10.2172/10133402
Subject(s) - perceptron , separable space , boolean function , function (biology) , disjunctive normal form , computer science , finite set , polynomial , set (abstract data type) , line (geometry) , algorithm , discrete mathematics , mathematics , artificial intelligence , theoretical computer science , combinatorics , artificial neural network , mathematical analysis , geometry , evolutionary biology , biology , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here