Sciweavers

58 search results - page 10 / 12
» A Dynamic Allocation Method of Basis Functions in Reinforcem...
Sort
View
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 7 months ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen
APNOMS
2009
Springer
13 years 5 months ago
Network Partitioning and Self-sizing Methods for QoS Management with Autonomic Characteristics
The inherent and increasing complexity, heterogeneity and unpredictability of computer networks make the task of managing these systems highly complex. The autonomic computing para...
Romildo Martins da Silva Bezerra, Joberto Sé...
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
14 years 2 months ago
Apply ant colony optimization to Tetris
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
Xingguo Chen, Hao Wang, Weiwei Wang, Yinghuan Shi,...
IROS
2007
IEEE
168views Robotics» more  IROS 2007»
14 years 1 months ago
Improving humanoid locomotive performance with learnt approximated dynamics via Gaussian processes for regression
Abstract— We propose to improve the locomotive performance of humanoid robots by using approximated biped stepping and walking dynamics with reinforcement learning (RL). Although...
Jun Morimoto, Christopher G. Atkeson, Gen Endo, Go...
COMCOM
2008
127views more  COMCOM 2008»
13 years 7 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...