403 search results - page 26 / 81 » Sampling Bounds for Stochastic Optimization |
CP
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
WCE
2007
15 years 27 days ago
2007
— The rapid transit network design problem considers at upper level the list of potential transit corridors and stations to design the network as a discrete space of alternatives...
IOR
2010
14 years 10 months ago
2010
We study an inventory system under periodic review in the presence of two suppliers (or delivery modes). The emergency supplier has a shorter lead-time than the regular supplier, ...
83
Voted
AIPS
2009
15 years 26 days ago
2009
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
MCS
2007
Springer
14 years 11 months ago
2007
Springer
We describe a Monte Carlo method for the numerical computation of the principal eigenvalue of the Laplace operator in a bounded domain with Dirichlet conditions. It is based on th...