4894 search results - page 75 / 979 » The Guarding Problem - Complexity and Approximation |
MOC
2002
13 years 8 months ago
2002
We consider a family of tensor product finite element methods for hyperbolic equations in RN , N 2, which are explicit and generate a continuous approximate solution. The base cas...
ICCSA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
—TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
EVOW
2006
Springer
14 years 18 days ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...