1068 search results - page 76 / 214 » Extremely randomized trees |
ICDCS
1999
IEEE
14 years 2 months ago
1999
IEEE
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
JACM
2007
13 years 9 months ago
2007
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
CTRSA
2003
Springer
14 years 3 months ago
2003
Springer
We present extremely simple ways of embedding a backdoor in the key generation scheme of RSA. Three of our schemes generate two genuinely random primes p and q of a given size, to...
SPAA
2000
ACM
14 years 2 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...