Sciweavers

403 search results - page 26 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
CP
2010
Springer
13 years 7 months ago
An Empirical Study of Optimization for Maximizing Diffusion in Networks
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...
Kiyan Ahmadizadeh, Bistra N. Dilkina, Carla P. Gom...
WCE
2007
13 years 11 months ago
Stochastic Urban Rapid Transit Network Design
— 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...
Carlos Bouza, Gemayzel Bouza, Ángel Mar&iac...
IOR
2010
112views more  IOR 2010»
13 years 8 months ago
New Policies for the Stochastic Inventory Control Problem with Two Supply Sources
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, ...
Anshul Sheopuri, Ganesh Janakiraman, Sridhar Sesha...
AIPS
2009
13 years 11 months ago
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
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...
Ronald Bjarnason, Alan Fern, Prasad Tadepalli
MCS
2007
Springer
13 years 9 months ago
Computing the principal eigenvalue of the Laplace operator by a stochastic method
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...
Antoine Lejay, Sylvain Maire