102 search results - page 5 / 21 » An Improved Pseudo-random Generator Based on Discrete Log |
IMECS
2007
13 years 8 months ago
2007
Abstract—We had previously proposed an outstanding evolutionary method, Automatically Defined Groups (ADG), for generating heterogeneous cooperative agents, and then we had deve...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...