3096 search results - page 141 / 620 » The Generalized FITC Approximation |
APPROX
2008
Springer
13 years 11 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...
DAGSTUHL
2007
13 years 10 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
NIPS
2008
13 years 10 months ago
2008
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
SIROCCO
2008
13 years 10 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
WSC
2004
13 years 10 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...