Sciweavers

177 search results - page 18 / 36
» Learning complex problem solving expertise from failures
Sort
View
115
Voted
ECAI
2006
Springer
15 years 5 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
110
Voted
DCOSS
2005
Springer
15 years 7 months ago
A Local Facility Location Algorithm for Sensor Networks
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
Denis Krivitski, Assaf Schuster, Ran Wolff
ICML
2009
IEEE
16 years 2 months ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
98
Voted
CE
2006
161views more  CE 2006»
15 years 1 months ago
Applying an authentic, dynamic learning environment in real world business
This paper describes a dynamic computer-based business learning environment and the results from applying it in a real-world business organization. We argue for using learning too...
Timo Lainema, Sami Nurmi
ICML
2003
IEEE
16 years 2 months ago
Hierarchical Policy Gradient Algorithms
Hierarchical reinforcement learning is a general framework which attempts to accelerate policy learning in large domains. On the other hand, policy gradient reinforcement learning...
Mohammad Ghavamzadeh, Sridhar Mahadevan