1449 search results - page 54 / 290 » Self-Randomized Exponentiation Algorithms |
95
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
138
Voted
JOC
2010
14 years 7 months ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
112
Voted
NOSSDAV
1995
Springer
15 years 4 months ago
1995
Springer
We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-byPacket Generalized Processor Sharing and Self Clocked Fair Queuing....
117
Voted
CCCG
1998
15 years 1 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
117
Voted
CORR
2008
Springer
15 years 19 days ago
2008
Springer
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...