403 search results - page 31 / 81 » Sampling Bounds for Stochastic Optimization |
SAGA
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
4OR
2006
13 years 10 months ago
2006
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
FLAIRS
2009
13 years 7 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...