Sciweavers

406 search results - page 7 / 82
» Gadgets, Approximation, and Linear Programming
Sort
View
ENDM
2010
115views more  ENDM 2010»
13 years 7 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
IJCNN
2006
IEEE
14 years 3 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
TSMC
2008
140views more  TSMC 2008»
13 years 9 months ago
Adaptive Feedback Control by Constrained Approximate Dynamic Programming
A constrained approximate dynamic programming (ADP) approach is presented for designing adaptive neural network (NN) controllers with closed-loop stability and performance guarante...
S. Ferrari, J. E. Steck, R. Chandramohan
ICML
2006
IEEE
14 years 3 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
FSS
2002
125views more  FSS 2002»
13 years 9 months ago
An "orderwise" polynomial regression procedure for fuzzy data
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...
Pierpaolo D'Urso, Tommaso Gastaldi