Sciweavers

227 search results - page 6 / 46
» A splitting method for stochastic programs
Sort
View
EUROPAR
2004
Springer
14 years 29 days ago
Architecture-Independent Meta-optimization by Aggressive Tail Splitting
Several optimization techniques are hindered by uncertainties about the control flow in a program, which can generally not be determined by static methods at compile time. We pres...
Michael Rock, Andreas Koch
PC
2000
160views Management» more  PC 2000»
13 years 7 months ago
Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints
In this paper we present a parallel method for solving two-stage stochastic linear programs with restricted recourse. The mathematical model considered here can be used to represe...
Patrizia Beraldi, Lucio Grandinetti, Roberto Musma...
AUTOMATICA
2011
13 years 2 months ago
Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
William M. McEneaney
FM
2009
Springer
124views Formal Methods» more  FM 2009»
14 years 2 months ago
Reasoning about Memory Layouts
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
Holger Gast
IOR
2011
152views more  IOR 2011»
13 years 2 months ago
Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...
Naomi Miller, Andrzej Ruszczynski