Sciweavers

424 search results - page 18 / 85
» Boosted sampling: approximation algorithms for stochastic op...
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 8 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
CVPR
2007
IEEE
14 years 9 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
CDC
2009
IEEE
143views Control Systems» more  CDC 2009»
13 years 10 months ago
Parameter approximate dynamic optimization for PSO systems
— This paper presents a novel swarm approximate dynamic programming method (swarm-ADP) for parameter optimization of PSO systems, from the perspective of optimal control. Based o...
Qi Kang, Lei Wang, Derong Liu, Qidi Wu
HEURISTICS
2008
120views more  HEURISTICS 2008»
13 years 7 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
ACL
2006
13 years 9 months ago
Approximation Lasso Methods for Language Modeling
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
Jianfeng Gao, Hisami Suzuki, Bin Yu