Sciweavers

1177 search results - page 209 / 236
» Iterative methods for Robbins problems
Sort
View
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 8 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein
COR
2008
99views more  COR 2008»
13 years 8 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
FCSC
2007
159views more  FCSC 2007»
13 years 8 months ago
Ranking with uncertain labels and its applications
1 The techniques for image analysis and classi cation generally consider the image sample labels xed and without uncertainties. The rank regression problem is studied in this pape...
Shuicheng Yan, Huan Wang, Jianzhuang Liu, Xiaoou T...
MP
2006
103views more  MP 2006»
13 years 8 months ago
Assessing solution quality in stochastic programs
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
Güzin Bayraksan, David P. Morton
PR
2008
85views more  PR 2008»
13 years 8 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders