447 search results - page 8 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
COMPUTING
2008
13 years 7 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
UAI
2004
13 years 8 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
NIPS
2007
13 years 8 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
CCCG
2007
13 years 8 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
JGAA
2006
13 years 7 months ago
2006
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...