Sciweavers

2354 search results - page 17 / 471
» Randomness, Stochasticity and Approximations
Sort
View
GLOBECOM
2009
IEEE
13 years 11 months ago
Optimal Resource Scheduling in Wireless Multiservice Systems with Random Channel Connectivity
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...
Hussein Al-Zubaidy, Ioannis Lambadaris, Ioannis Vi...
EOR
2006
104views more  EOR 2006»
13 years 7 months ago
A factor 1/2 approximation algorithm for two-stage stochastic matching problems
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
Nan Kong, Andrew J. Schaefer
AUTOMATICA
2008
107views more  AUTOMATICA 2008»
13 years 7 months ago
New algorithms of the Q-learning type
We propose two algorithms for Q-learning that use the two-timescale stochastic approximation methodology. The first of these updates Q-values of all feasible state
Shalabh Bhatnagar, K. Mohan Babu
DAGSTUHL
2004
13 years 9 months ago
Numerical Approximation of Parabolic Stochastic Partial Differential Equations
The topic of the talk were the time approximation of quasi linear stochastic partial differential equations of parabolic type. The framework were in the setting of stochastic evolu...
Erika Hausenblas
ICALP
2001
Springer
14 years 5 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan