401 search results - page 63 / 81 » Algorithms for a Simple Point Placement Problem |
ICRA
2003
IEEE
14 years 21 days ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
ATMOS
2010
13 years 6 months ago
2010
Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
ISAAC
2005
Springer
14 years 28 days ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...