5580 search results - page 36 / 1116 » Randomized priority algorithms |
AICCSA
2001
IEEE
15 years 1 months ago
2001
IEEE
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...
121
click to vote
EC
2007
14 years 9 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
IDA
2007
Springer
15 years 3 months ago
2007
Springer
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
JAIR
2006
14 years 9 months ago
2006
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =