73 search results - page 9 / 15 » Time Convex Hull with a Highway |
CCCG
2009
13 years 8 months ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
MP
2006
13 years 7 months ago
2006
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
IPCO
2004
13 years 8 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We propose a method for extracting a gaze region from an observed image by analyzing human's view directions and image information. The view direction of the user, which is r...
ICRA
1994
IEEE
13 years 11 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...