349 search results - page 37 / 70 » Covering a Set of Points with a Minimum Number of Lines |
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
BSL
2011
13 years 2 months ago
2011
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
ATMOS
2008
13 years 9 months ago
2008
The problem of robust line planning requests for a set of origin-destination paths (lines) along with their traffic rates (frequencies) in an underlying railway network infrastruct...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...