1684 search results - page 93 / 337 » The lexicographic decision function |
126
Voted
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
158
Voted
CASC
2009
Springer
15 years 4 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
127
Voted
TPHOL
2000
IEEE
15 years 7 months ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
134
click to vote
COLT
2001
Springer
15 years 8 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
132
Voted
JAIR
2010
15 years 2 months ago
2010
This paper deals with value (and Q-) function approximation in deterministic Markovian decision processes (MDPs). A general statistical framework based on the Kalman filtering pa...