4255 search results - page 104 / 851 » On Learning Boolean Functions |
111
click to vote
MSV
2004
15 years 3 months ago
2004
A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progr...
92
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
188
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
105
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
97
Voted
COLT
2001
Springer
15 years 6 months ago
2001
Springer
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Unifor...