4110 search results - page 380 / 822 » Efficient algorithms for the 2-gathering problem |
176
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
180
click to vote
MASCOTS
2010
15 years 8 months ago
2010
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...
184
click to vote
AIPS
2009
15 years 8 months ago
2009
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
179
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Hierarchies are a powerful tool for image segmentation, they produce a multiscale representation which allows to design robust algorithms and can be stored in tree-like structures...
262
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...