416 search results - page 36 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
139
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
137
click to vote
INFORMATICALT
2010
14 years 9 months ago
2010
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
109
click to vote
ACG
2006
Springer
15 years 9 months ago
2006
Springer
Most game programs have a large number of parameters that are crucial for their performance. Tuning these parameters by hand is rather difficult. Therefore automatic optimization a...
107
click to vote
NIPS
2007
15 years 4 months ago
2007
Web servers on the Internet need to maintain high reliability, but the cause of intermittent failures of web transactions is non-obvious. We use approximate Bayesian inference to ...
137
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
As a well known fixed-point iteration algorithm for kernel
density mode-seeking, Mean-Shift has attracted wide attention
in pattern recognition field. To date, Mean-Shift algorit...