562 search results - page 10 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
ICALP
2003
Springer
14 years 18 days ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
CCCG
2010
13 years 8 months ago
2010
For a given mountain-valley pattern of equidistant creases on a long strip paper, there are many folded states consistent with the pattern. Among these folded states, we like to f...
COMPGEOM
1997
ACM
13 years 11 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
COMGEO
1999
ACM
13 years 7 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
AAAI
1998
13 years 8 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...