Sciweavers

2073 search results - page 122 / 415
» Learning for Dynamic Subsumption
Sort
View
141
Voted
CIG
2005
IEEE
15 years 9 months ago
Nannon: A Nano Backgammon for Machine Learning Research
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
Jordan B. Pollack
130
Voted
ICDM
2005
IEEE
163views Data Mining» more  ICDM 2005»
15 years 9 months ago
Balancing Exploration and Exploitation: A New Algorithm for Active Machine Learning
Active machine learning algorithms are used when large numbers of unlabeled examples are available and getting labels for them is costly (e.g. requiring consulting a human expert)...
Thomas Takeo Osugi, Kun Deng, Stephen D. Scott
139
Voted
ICRA
2002
IEEE
133views Robotics» more  ICRA 2002»
15 years 8 months ago
The Necessity of Average Rewards in Cooperative Multirobot Learning
Learning can be an effective way for robot systems to deal with dynamic environments and changing task conditions. However, popular singlerobot learning algorithms based on discou...
Poj Tangamchit, John M. Dolan, Pradeep K. Khosla
140
Voted
ICML
2000
IEEE
15 years 7 months ago
A Bayesian Framework for Reinforcement Learning
The reinforcement learning problem can be decomposed into two parallel types of inference: (i) estimating the parameters of a model for the underlying process; (ii) determining be...
Malcolm J. A. Strens
WSC
2007
15 years 5 months ago
Optimizing time warp simulation with reinforcement learning techniques
Adaptive Time Warp protocols in the literature are usually based on a pre-defined analytic model of the system, expressed as a closed form function that maps system state to cont...
Jun Wang, Carl Tropper