Sciweavers

231 search results - page 1 / 47
» Stochastic Optimization is (Almost) as easy as Deterministic...
Sort
View
FOCS
2004
IEEE
14 years 2 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
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...
David B. Shmoys, Chaitanya Swamy
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 5 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—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...
Nitin Saxena, C. Seshadhri
AAAI
2008
14 years 1 months ago
Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing
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...
Craig Boutilier, David C. Parkes, Tuomas Sandholm,...
DEDS
2006
78views more  DEDS 2006»
13 years 11 months ago
The Equivalence between Ordinal Optimization in Deterministic Complex Problems and in Stochastic Simulation Problems
In the last decade ordinal optimization (OO) has been successfully applied in many stochastic simulation-based optimization problems (SP) and deterministic complex problems (DCP). ...
Yu-Chi Ho, Qing-Shan Jia, Qianchuan Zhao
WSC
1997
14 years 15 days ago
An Integrated Framework for Deterministic and Stochastic Optimization
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...
Leyuan Shi, Sigurdur Ólafsson