5580 search results - page 112 / 1116 » Randomized priority algorithms |
RSA
2006
14 years 9 months ago
2006
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
AI
2002
Springer
14 years 9 months ago
2002
Springer
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
GD
2000
Springer
15 years 1 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
JGAA
2002
14 years 9 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
FUIN
2002
14 years 9 months ago
2002
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability