4894 search results - page 232 / 979 » The Guarding Problem - Complexity and Approximation |
172
click to vote
SIROCCO
2008
15 years 8 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
158
click to vote
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
193
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
151
click to vote
ICAI
2009
15 years 4 months ago
2009
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...
182
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...