231 search results - page 1 / 47 » Stochastic Optimization is (Almost) as easy as Deterministic... |
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
AAAI
2008
13 years 7 months ago
2008
We present the design of a banner advertising auction which is considerably more expressive than current designs. We describe a general model of expressive ad contracts/bidding an...
DEDS
2006
13 years 4 months ago
2006
In the last decade ordinal optimization (OO) has been successfully applied in many stochastic simulation-based optimization problems (SP) and deterministic complex problems (DCP). ...
WSC
1997
13 years 6 months ago
1997
In recent articles we presented a general methodology for finite optimization. The new method, the Nested Partitions (NP) method, combines partitioning, random sampling, a select...