Sciweavers

500 search results - page 16 / 100
» A Sample Approximation Approach for Optimization with Probab...
Sort
View
GECCO
2010
Springer
200views Optimization» more  GECCO 2010»
14 years 21 days ago
Multivariate multi-model approach for globally multimodal problems
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
Chung-Yao Chuang, Wen-Lian Hsu
SIAMJO
2008
57views more  SIAMJO 2008»
13 years 7 months ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel
ANOR
2002
100views more  ANOR 2002»
13 years 7 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...
ICML
2004
IEEE
14 years 8 months ago
Variational methods for the Dirichlet process
Variational inference methods, including mean field methods and loopy belief propagation, have been widely used for approximate probabilistic inference in graphical models. While ...
David M. Blei, Michael I. Jordan
SIGECOM
2009
ACM
110views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
On random sampling auctions for digital goods
In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truth...
Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasa...