4894 search results - page 767 / 979 » The Guarding Problem - Complexity and Approximation |
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract-- In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
PAMI
2011
13 years 3 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
SIAMSC
2011
13 years 3 months ago
2011
Abstract. Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can ...
VC
2011
13 years 3 months ago
2011
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...