Sciweavers

4544 search results - page 859 / 909
» Reinforcement Learning with Time
Sort
View
EATCS
1998
250views more  EATCS 1998»
13 years 9 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré
IJON
1998
172views more  IJON 1998»
13 years 9 months ago
Blind separation of convolved mixtures in the frequency domain
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
Paris Smaragdis
NN
2002
Springer
115views Neural Networks» more  NN 2002»
13 years 9 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
TCSV
2002
132views more  TCSV 2002»
13 years 9 months ago
A study of real-time packet video quality using random neural networks
An important and unsolved problem today is the automatic quantification of the quality of video flows transmitted over packet networks. In particular, the ability to perform this ...
Samir Mohamed, Gerardo Rubino
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 9 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh