Sciweavers

6251 search results - page 1114 / 1251
» Randomness, Computability, and Density
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
14 years 11 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
136
Voted
CDC
2010
IEEE
173views Control Systems» more  CDC 2010»
14 years 11 months ago
Corrective consensus: Converging to the exact average
Consensus algorithms provide an elegant distributed way for computing the average of a set of measurements across a sensor network. However, the convergence of the node estimates t...
Yin Chen, Roberto Tron, Andreas Terzis, René...
188
Voted
CORR
2011
Springer
210views Education» more  CORR 2011»
14 years 11 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 11 months ago
Polynomial Estimators for High Frequency Moments
We present an algorithm for computing Fp, the pth moment of an n-dimensional frequency vector of a data stream, for p > 2, to within 1 ± factors, ∈ (0, 1] with high constant...
Sumit Ganguly
EOR
2011
134views more  EOR 2011»
14 years 11 months ago
Linear programming based decomposition methods for inventory distribution systems
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
Sumit Kunnumkal, Huseyin Topaloglu
« Prev « First page 1114 / 1251 Last » Next »