4894 search results - page 146 / 979 » The Guarding Problem - Complexity and Approximation |
174
click to vote
JCC
2007
15 years 6 months ago
2007
Abstract: The physical interactions among electrons and nuclei, responsible for the chemistry of atoms and molecules, is well described by quantum mechanics and chemistry is theref...
189
click to vote
AAIM
2006
Springer
16 years 12 days ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
163
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
177
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
210
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...