Sciweavers

888 search results - page 137 / 178
» Learning to Select a Ranking Function
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
13 years 7 months ago
The Interactive Curry Observation Debugger iCODE
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and rem...
Parissa H. Sadeghi, Frank Huch
EVOW
2010
Springer
14 years 2 months ago
Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search
Monte Carlo Tree Search is a recent algorithm that achieves more and more successes in various domains. We propose an improvement of the Monte Carlo part of the algorithm by modify...
Arpad Rimmel, Fabien Teytaud
GECCO
2004
Springer
14 years 1 months ago
Self Adaptation of Operator Rates in Evolutionary Algorithms
Abstract. This work introduces a new evolutionary algorithm that adapts the operator probabilities (rates) while evolves the solution of the problem. Each individual encodes its ge...
Jonatan Gomez
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
JMLR
2012
11 years 10 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell