10148 search results - page 203 / 2030 » Optimal sub-graphical models |
151
click to vote
WSC
2008
15 years 6 months ago
2008
We consider the problem of selecting the best among several heavy-tailed systems using a large deviations perspective. In contrast to the light-tailed setting studied by Glynn and...
127
click to vote
IJCAI
2003
15 years 5 months ago
2003
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
147
click to vote
WSC
2004
15 years 5 months ago
2004
This paper develops a variant of Simulated Annealing (SA) algorithm for solving discrete stochastic optimization problems where the objective function is stochastic and can be eva...
133
click to vote
WSC
1997
15 years 5 months ago
1997
This paper deals with ranking and selection problem via simulation. We present an optimal computing budget allocation technique which can select the best of k simulated designs. T...
125
click to vote
COMCOM
2010
15 years 4 months ago
2010
We study the interaction between the MIMD (Multiplicative Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the probl...