4255 search results - page 58 / 851 » On Learning Boolean Functions |
100
click to vote
CLEF
2006
Springer
15 years 1 months ago
2006
Springer
This paper describes our participation in the GeoCLEF monolingual English task of the Cross Language Evaluation Forum 2006. The main objective of this study is to evaluate the retr...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
IJCNN
2007
IEEE
15 years 4 months ago
2007
IEEE
— Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT solvers for industrial applications are based on...
116
click to vote
ICLP
2011
Springer
14 years 1 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...