1667 search results - page 84 / 334 » Extended clause learning |
153
click to vote
COLT
2001
Springer
15 years 9 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
114
click to vote
AAAI
2008
15 years 6 months ago
2008
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
123
click to vote
ACL
2008
15 years 5 months ago
2008
We extend the classical single-task active learning (AL) approach. In the multi-task active learning (MTAL) paradigm, we select examples for several annotation tasks rather than f...
126
click to vote
NIPS
2007
15 years 5 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
108
Voted
AAAI
1994
15 years 5 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...