1263 search results - page 180 / 253 » A* with Bounded Costs |
180
click to vote
COLT
2005
Springer
15 years 8 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
161
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
181
click to vote
CCCG
2008
15 years 7 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
206
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
188
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We consider a class of region-based energies for image
segmentation and inpainting which combine region integrals
with curvature regularity of the region boundary. To
minimize s...