4894 search results - page 560 / 979 » The Guarding Problem - Complexity and Approximation |
150
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
We consider Fisher and Arrow-Debreu markets under additively-separable, piecewise-linear, concave utility functions, and obtain the following results: ? For both market models, if...
198
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
132
Voted
CVPR
2010
IEEE
16 years 16 days ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
134
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...
100
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...