6251 search results - page 242 / 1251 » Randomness, Computability, and Density |
137
click to vote
COMPGEOM
1999
ACM
15 years 8 months ago
1999
ACM
Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...
160
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
132
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
130
click to vote
MFCS
1995
Springer
15 years 8 months ago
1995
Springer
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...
147
click to vote
FOCS
1994
IEEE
15 years 8 months ago
1994
IEEE
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...