Sciweavers

2745 search results - page 313 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
FOCS
2005
IEEE
15 years 10 months ago
Mechanism Design via Machine Learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
ICML
2009
IEEE
16 years 6 months ago
Regularization and feature selection in least-squares temporal difference learning
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
J. Zico Kolter, Andrew Y. Ng
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
15 years 10 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
IMECS
2007
15 years 6 months ago
Metamodel-Assisted Global Search Using a Probing Technique
—This paper presents a new metamodel-assisted metaheuristic algorithm for optimisation problems involving computationally expensive simulations. The algorithm, called Global Prob...
Anna Persson, Henrik Grimm, Amos Ng
PPSN
2004
Springer
15 years 10 months ago
Finding Knees in Multi-objective Optimization
Abstract. Many real-world optimization problems have several, usually conflicting objectives. Evolutionary multi-objective optimization usually solves this predicament by searchin...
Jürgen Branke, Kalyanmoy Deb, Henning Dierolf...