Sciweavers

132 search results - page 24 / 27
» Generalization in Reinforcement Learning: Safely Approximati...
Sort
View
ASC
2007
14 years 9 months ago
An approximate stability analysis of nonlinear systems described by Universal Learning Networks
Stability is one of the most important subjects in control systems. As for the stability of nonlinear dynamical systems, Lyapunov’s direct method and linearized stability analys...
Kotaro Hirasawa, Shingo Mabu, Shinji Eto, Jinglu H...
SASO
2008
IEEE
15 years 3 months ago
Self-Adaptive Dissemination of Data in Dynamic Sensor Networks
The distribution of data in large dynamic wireless sensor networks presents a difficult problem due to node mobility, link failures, and traffic congestion. In this paper, we pr...
David Dorsey, Bjorn Jay Carandang, Moshe Kam, Chri...
ICML
1994
IEEE
15 years 1 months ago
A Modular Q-Learning Architecture for Manipulator Task Decomposition
Compositional Q-Learning (CQ-L) (Singh 1992) is a modular approach to learning to performcomposite tasks made up of several elemental tasks by reinforcement learning. Skills acqui...
Chen K. Tham, Richard W. Prager
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
14 years 11 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
14 years 10 months ago
Self-adaptive mutation in XCSF
Recent advances in XCS technology have shown that selfadaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown...
Martin V. Butz, Patrick O. Stalph, Pier Luca Lanzi