Sciweavers

255 search results - page 26 / 51
» Generalized Boosting Algorithms for Convex Optimization
Sort
View
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 8 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 8 days ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
ECCC
2006
218views more  ECCC 2006»
13 years 8 months ago
Efficient Algorithms for Online Game Playing and Universal Portfolio Management
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
Amit Agarwal, Elad Hazan
VLDB
1998
ACM
127views Database» more  VLDB 1998»
14 years 29 days ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
14 years 2 months ago
An extended mutation concept for the local selection based differential evolution algorithm
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Jani Rönkkönen, Jouni Lampinen