Sciweavers

2354 search results - page 49 / 471
» Randomness, Stochasticity and Approximations
Sort
View
CCE
2004
13 years 7 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
ANOR
2006
59views more  ANOR 2006»
13 years 7 months ago
The empirical behavior of sampling methods for stochastic programming
Abstract. We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed sof...
Jeff Linderoth, Alexander Shapiro, Stephen Wright
TSMC
2008
113views more  TSMC 2008»
13 years 7 months ago
Computational Methods for Verification of Stochastic Hybrid Systems
Stochastic hybrid system (SHS) models can be used to analyze and design complex embedded systems that operate in the presence of uncertainty and variability. Verification of reacha...
Xenofon D. Koutsoukos, Derek Riley
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
14 years 1 months ago
Vertex Cover Approximations on Random Graphs
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
Eyjolfur Asgeirsson, Clifford Stein
WSC
2008
13 years 10 months ago
The mathematics of continuous-variable simulation optimization
Continuous-variable simulation optimization problems are those optimization problems where the objective function is computed through stochastic simulation and the decision variab...
Sujin Kim, Shane G. Henderson