Sciweavers

1675 search results - page 26 / 335
» The Value of a Good Name
Sort
View
NN
2010
Springer
187views Neural Networks» more  NN 2010»
13 years 2 months ago
Efficient exploration through active learning for value function approximation in reinforcement learning
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares ...
Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiya...
PODC
2011
ACM
12 years 10 months ago
A nonblocking set optimized for querying the minimum value
We present the Mindicator, a set implementation customized for shared memory runtime systems. The Mindicator is optimized for constant-time querying of its minimum element, while ...
Yujie Liu, Michael F. Spear
DM
2008
58views more  DM 2008»
13 years 7 months ago
A two-parameter family of an extension of Beatty sequences
Beatty sequences n + are nearly linear, also called balanced, namely, the absolute value of the difference D of the number of el
Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T...
KI
2001
Springer
13 years 12 months ago
Extracting Situation Facts from Activation Value Histories in Behavior-Based Robots
The paper presents a new technique for extracting symbolic ground facts out of the sensor data stream in autonomous robots for use under hybrid control architectures, which compris...
Frank Schönherr, Mihaela Cistelecan, Joachim ...
SIAMSC
2008
187views more  SIAMSC 2008»
13 years 7 months ago
The Generalized Singular Value Decomposition and the Method of Particular Solutions
A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name "point matching method". In ...
Timo Betcke