952 search results - page 87 / 191 » Computational complexity of stochastic programming problems |
86
Voted
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
106
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
114
click to vote
WINE
2005
Springer
15 years 6 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
121
click to vote
VALUETOOLS
2006
ACM
15 years 6 months ago
2006
ACM
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
73
Voted
TCS
2010
14 years 11 months ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...