2031 search results - page 124 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
ANTSW
2010
Springer
13 years 6 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...