3475 search results - page 281 / 695 » Backbones in Optimization and Approximation |
188
click to vote
ESANN
2001
15 years 8 months ago
2001
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
162
click to vote
WSC
2001
15 years 8 months ago
2001
Various stochastic programmingproblemscan be formulated as problems of optimization of an expected value function. Quite often the corresponding expectation function cannot be com...
200
click to vote
NIPS
2003
15 years 8 months ago
2003
We present a novel method for approximate inference in Bayesian models and regularized risk functionals. It is based on the propagation of mean and variance derived from the Lapla...
153
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
160
click to vote
ECCC
2006
15 years 6 months ago
2006
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...