1930 search results - page 127 / 386 » Learning to Solve QBF |
149
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
129
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
133
click to vote
AB
2007
Springer
15 years 10 months ago
2007
Springer
Whenever a programmer writes a loop, or a mathematician does a proof by induction, an invariant is involved. The discovery and understanding of invariants often underlies problem s...
158
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
137
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...