1736 search results - page 74 / 348 » String Extension Learning |
140
click to vote
AAAI
2010
15 years 5 months ago
2010
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
106
click to vote
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 ...
138
Voted
JMLR
2010
14 years 11 months ago
2010
Recent research has seen the proposal of several new inductive principles designed specifically to avoid the problems associated with maximum likelihood learning in models with in...
143
Voted
NIPS
2007
15 years 5 months ago
2007
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
128
click to vote
ML
2008
ACM
15 years 4 months ago
2008
ACM
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. Hitherto existing approaches to label ranking implicitly operat...