3875 search results - page 53 / 775 » Approximation algorithms for the 0-extension problem |
106
click to vote
ORL
1998
15 years 1 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
128
click to vote
SIAMJO
2010
14 years 8 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
119
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
142
click to vote
IJCAI
2001
15 years 3 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...